Integrality Property in Preemptive Parallel Machine Scheduling
From MaRDI portal
Publication:3392940
DOI10.1007/978-3-642-03351-3_6zbMATH Open1250.90032OpenAlexW1485186545MaRDI QIDQ3392940FDOQ3392940
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
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
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- How useful are preemptive schedules?
- Open Shop Scheduling to Minimize Finish Time
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines
- Scheduling with deadlines and loss functions
- Title not available (Why is that?)
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Preemptive Scheduling of Uniform Processor Systems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Title not available (Why is that?)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Properties of optimal schedules in preemptive shop scheduling
- 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
- Rational preemptive scheduling
- Title not available (Why is that?)
- On the approximability of average completion time scheduling under precedence constraints.
Cited In (1)
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)
