A note on the equivalence of two heuristics to minimize total tardiness

DOI10.1016/S0377-2217(95)00255-3zbMath0917.90183MaRDI QIDQ1278526

Bahram Alidaee, Suresh Gopalan

Publication date: 5 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

single machinetotal tardinessmodified due date rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ The single-machine total tardiness scheduling problem: review and extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A heuristic for the single machine tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Technical Note—A Note on the Weighted Tardiness Problem
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• The Total Tardiness Problem: Review and Extensions
• Heuristics for minimizing mean tardiness form parallel machines