Pages that link to "Item:Q3892057"

The following pages link to Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem (Q3892057):

Displaying 10 items.

• Parametric precedence relations in single machine scheduling (Q916560) (← links)
• Sequencing jobs on a single machine with a common due data and stochastic processing times (Q1179194) (← links)
• An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
• Minimizing the sum of squares lateness on a single machine (Q1848630) (← links)
• Single machine scheduling with nonlinear cost functions (Q2277133) (← links)
• For the airplane refueling problem local precedence implies global precedence (Q2341094) (← links)
• The local-global conjecture for scheduling with non-linear cost (Q2400434) (← links)
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)