A greedy heuristic for the mean tardiness sequencing problem
From MaRDI portal
Publication:1317079
DOI10.1016/0305-0548(94)90094-9zbMath0796.90034MaRDI 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
90B35: Deterministic scheduling theory in operations research
Related Items
The single-machine total tardiness scheduling problem: review and extensions, Scheduling parallel machines to minimize total weighted and unweighted tardiness, 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
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