Pages that link to "Item:Q1208472"
From MaRDI portal
The following pages link to On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472):
Displaying 12 items.
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Minimizing the number of tardy job units under release time constraints (Q919993) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818) (← 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)
- The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization (Q3802872) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell (Q4230116) (← links)
- High Multiplicity in Earliness-Tardiness Scheduling (Q4530664) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
