Decomposition of the single machine total tardiness problem

DOI10.1016/S0167-6377(96)00031-4zbMath0874.90108MaRDI QIDQ1362989

Samar K. Mukhopadhyay, Wlodzimierz Szwarc

Publication date: 7 August 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

decomposition; branch and bound; single machine total tardiness problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem, A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems, The single-machine total tardiness scheduling problem: review and extensions, Solution of the single machine total tardiness problem, Minimizing total tardiness in a scheduling problem with a learning effect

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness