Single-machine scheduling with release times and tails
From MaRDI portal
Publication:596466
DOI10.1023/B:ANOR.0000030692.69147.E2zbMath1056.90074OpenAlexW1988478577MaRDI QIDQ596466
Publication date: 10 August 2004
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:anor.0000030692.69147.e2
Related Items (8)
Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time ⋮ 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 ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Jackson's semi-preemptive scheduling on a single machine ⋮ Theoretical and practical issues in single-machine scheduling with two job release and delivery times ⋮ Order assignment and scheduling under processing and distribution time uncertainty
This page was built for publication: Single-machine scheduling with release times and tails
