A greedy heuristic for the mean tardiness sequencing problem

DOI10.1016/0305-0548(94)90094-9zbMath0796.90034OpenAlexW2093215438MaRDI QIDQ1317079

Martin S. Levy, James R. Evans, Adam Fadlalla

Publication date: 26 September 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90094-9

zbMATH Keywords

heuristicssingle processoraverage tardinessmean tardiness problemsequencing a set of jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Improved heuristics for the early/tardy scheduling problem with no idle time ⋮ Improving the performance of enumerative search methods. I: Exploiting structure and intelligence ⋮ Improving the performance of enumerative search methods. II: Computational experiments ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ The single-machine total tardiness scheduling problem: review and extensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness