Integrality Property in Preemptive Parallel Machine Scheduling

DOI10.1007/978-3-642-03351-3_6MaRDI QIDQ3392940zbMATH OpenOpenAlexFDO

Authors Philippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Maxim Sviridenko, Sergey Sevastyanov

Publication date 18 August 2009

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03351-3_6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Integer preemptive scheduling on parallel machines
• Structural properties of optimal schedules with preemption
• Properties of optimal schedules in preemptive shop scheduling
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 6157244 (Why is no real title available?)
• How useful are preemptive schedules?
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines
• On the approximability of average completion time scheduling under precedence constraints.
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive Scheduling of Uniform Processor Systems
• Properties of optimal schedules in preemptive shop scheduling
• Rational preemptive scheduling
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Scheduling with deadlines and loss functions
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time

Cited in

(1)

• How small are shifts required in optimal preemptive schedules?

This page was built for publication: Integrality Property in Preemptive Parallel Machine Scheduling

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