Single-machine scheduling with release times and tails
From MaRDI portal
Publication:596466
DOI10.1023/B:ANOR.0000030692.69147.e2zbMath1056.90074MaRDI QIDQ596466
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time, A simulated annealing approach to minimize the maximum lateness on uniform parallel machines, Jackson's semi-preemptive scheduling on a single machine, Theoretical expectation versus practical performance of Jackson's heuristic, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, Fast solution of single-machine scheduling problem with embedded jobs