Pages that link to "Item:Q1208472"

The following pages link to On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472):

Displaying 6 items.

• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
• Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
• A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
• A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
• An evaluation of group scheduling heuristics in a flow-line manufacturing cell (Q4230116) (← links)
• Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)