How useful are preemptive schedules?

DOI10.1016/S0167-6377(02)00220-1MaRDI QIDQ1413904zbMATH OpenFDO

Authors Peter Brucker, Silvia Heitmann, Johann L. Hurink

Publication date 17 November 2003

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6377(02)00220-1

zbMATH Keywords

Parallel machine schedulingPreemption

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive and non-preemptive scheduling on two unrelated parallel machines
• Rational preemptive scheduling
• The power of preemption on unrelated machines and applications to scheduling orders
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
• On the Value of Preemption in Scheduling

Cites work

• Complexity results for scheduling chains on a single machine
• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 1757970 (Why is no real title available?)
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling with deadlines and loss functions

Cited in

(14)

• Scheduling with job release dates, delivery times and preemption penalties
• Integer preemptive scheduling on parallel machines
• Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time
• The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints
• How small are shifts required in optimal preemptive schedules?
• 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
• Integrality Property in Preemptive Parallel Machine Scheduling
• Preemptive scheduling in a two-stage supply chain to minimize the makespan
• Properties of optimal schedules in preemptive shop scheduling
• Unrelated parallel machine scheduling with random rework and limited preemption
• Preemptive scheduling with simple linear deterioration on a single machine
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs

This page was built for publication: How useful are preemptive schedules?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1413904)