An experimental comparison of solution algorithms for the single-machine tardiness problem

DOI10.1002/nav.3800210114zbMath0276.90025OpenAlexW2101152588MaRDI QIDQ4401714

Kenneth R. Baker, James B. Martin

Publication date: 1974

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800210114

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Related Items

A new branch and bound algorithm for minimizing the weighted number of tardy jobs, Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness, Real-time scheduling of an automated manufacturing center, Using tabu search to solve the common due date early/tardy machine scheduling problem, A hybrid heuristic approach to minimize number of tardy jobs in group technology systems, An efficient job scheduling algorithm for mixed turnaround and deadline applications, Hybrid algorithm for sequencing with bicriteria, A controlled search simulated annealing method for the single machine weighted tardiness problem, A dual algorithm for the one-machine scheduling problem, Four solution techniques for a general one machine scheduling problem. A comparative study, A survey of algorithms for the single machine total weighted tardiness scheduling problem, A note on the equivalence of two heuristics to minimize total tardiness, A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem, A study of integer programming formulations for scheduling problems, A heuristic for the single machine tardiness problem, A greedy heuristic for the mean tardiness sequencing problem, Performance enhancements to tabu search for the early/tardy scheduling problem