Integrality Property in Preemptive Parallel Machine Scheduling

DOI10.1007/978-3-642-03351-3_6zbMath1250.90032OpenAlexW1485186545MaRDI QIDQ3392940

Jacques Carlier, M. I. Sviridenko, Alexander V. Kononov, Maurice Queyranne, Philippe Baptiste, Sergey Sevast'janov

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)

Related Items

Feasibility analysis of sporadic real-time multiprocessor task systems, How small are shifts required in optimal preemptive schedules?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Properties of optimal schedules in preemptive shop scheduling
• Rational preemptive scheduling
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• On the approximability of average completion time scheduling under precedence constraints.
• 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
• Scheduling with Deadlines and Loss Functions
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Open Shop Scheduling to Minimize Finish Time
• Preemptive Scheduling of Uniform Processor Systems
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines