How useful are preemptive schedules?
From MaRDI portal
Publication:1413904
DOI10.1016/S0167-6377(02)00220-1zbMath1041.90015MaRDI QIDQ1413904
Peter Brucker, Silvia Heitmann, Johann L. Hurink
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (12)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job ⋮ Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs ⋮ Preemptive scheduling in a two-stage supply chain to minimize the makespan ⋮ Integer preemptive scheduling on parallel machines ⋮ Properties of optimal schedules in preemptive shop scheduling ⋮ Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling ⋮ Preemptive scheduling with simple linear deterioration on a single machine ⋮ The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints ⋮ Integrality Property in Preemptive Parallel Machine Scheduling ⋮ Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time ⋮ How small are shifts required in optimal preemptive schedules?
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity results for scheduling chains on a single machine
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling with Deadlines and Loss Functions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
This page was built for publication: How useful are preemptive schedules?
