Integer preemptive scheduling on parallel machines
From MaRDI portal
Publication:1939681
DOI10.1016/j.orl.2012.06.011zbMath1258.90035OpenAlexW2046192151MaRDI QIDQ1939681
Maurice Queyranne, Jacques Carlier, Philippe Baptiste, M. I. Sviridenko, Sergey Sevast'janov, Alexander V. Kononov
Publication date: 5 March 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.06.011
Related Items
Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines, Synchronous flow shop scheduling with pliable jobs
Cites Work
- Properties of optimal schedules in preemptive shop scheduling
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- How useful are preemptive schedules?
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
