Dominance and Decomposition Heuristics for Single Machine Scheduling
From MaRDI portal
Publication:3980517
DOI10.1287/opre.39.4.639zbMath0736.90042OpenAlexW1985557530MaRDI QIDQ3980517
Timothy J. Lowe, Robert J. Chambers, Robert L. Carraway, Thomas L. Morin
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.4.639
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Minimizing total weighted tardiness on a single batch process machine with incompatible job families ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ A new lower bounding scheme for the total weighted tardiness problem. ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ An advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances ⋮ Analysis of the temporal decomposition procedure for scheduling with release and due dates
