Dynamic programming and decomposition approaches for the single machine total tardiness problem
From MaRDI portal
Publication:1092805
DOI10.1016/S0377-2217(87)80008-5zbMath0627.90055MaRDI QIDQ1092805
Chris N. Potts, Luk N. Van Wassenhove
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (17)
A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times ⋮ Decomposition of the single machine total tardiness problem ⋮ Algebraic decompositions of DP problems with linear dynamics ⋮ An alternative framework to Lagrangian relaxation approach for job shop scheduling. ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem ⋮ A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine ⋮ An iterated greedy algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times ⋮ A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem ⋮ A strategy for evolution of algorithms to increase the computational effectiveness of NP-hard scheduling problems ⋮ Scheduling jobs on parallel machines with sequence-dependent setup times ⋮ A note on the equivalence of two heuristics to minimize total tardiness ⋮ A heuristic for the single machine tardiness problem ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- A decomposition algorithm for the single machine total tardiness problem
- A fully polynomial approximation scheme for the total tardiness problem
- On Dynamic Programming Methods for Assembly Line Balancing
- Minimizing Total Costs in One-Machine Scheduling
- A dual algorithm for the one-machine scheduling problem
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
This page was built for publication: Dynamic programming and decomposition approaches for the single machine total tardiness problem
