Properties of optimal schedules in preemptive shop scheduling
From MaRDI portal
Publication:628308
DOI10.1016/J.DAM.2010.11.015zbMATH Open1208.90053OpenAlexW2022226221MaRDI QIDQ628308FDOQ628308
Maxim Sviridenko, Sergey Sevastyanov, Jacques Carlier, Philippe Baptiste, Alexander Kononov, Maurice Queyranne
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.015
Recommendations
- Structural properties of optimal schedules with preemption
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
- Integer preemptive scheduling on parallel machines
- On the properties of optimal schedules in the flow shop problem with interruptions and an arbitrary regular criterion
- Some properties of optimal schedules for the Johnson problem with preemption
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Approximation algorithms for shop scheduling problems with minsum objective
- Title not available (Why is that?)
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- A Note on Open Shop Preemptive Schedules
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
Cited In (15)
- How small are shifts required in optimal preemptive schedules?
- Energy-efficient scheduling and routing via randomized rounding
- Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
- Synchronous flow shop scheduling with pliable jobs
- Resource constrained project scheduling subject to due dates: preemption permitted with penalty
- Arc-B-consistency of the inter-distance constraint
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Multimode preemptive resource investment problem subject to due dates for activities: formulation and solution procedure
- Integer preemptive scheduling on parallel machines
- The complexity of mean flow time scheduling problems with release times
- A complete 4-parametric complexity classification of short shop scheduling problems
- Integrality Property in Preemptive Parallel Machine Scheduling
- An optimal method for the preemptive job shop scheduling problem
- Normal-form preemption sequences for an open problem in scheduling theory
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
This page was built for publication: Properties of optimal schedules in preemptive shop scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628308)
