On preemption redundancy in scheduling unit processing time jobs on two parallel machines
From MaRDI portal
Publication:5945391
DOI10.1016/S0167-6377(01)00068-2zbMath0992.90026MaRDI QIDQ5945391
Philippe Baptiste, Timkovsky, Vadim G.
Publication date: 22 September 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00068-2
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job, Properties of optimal schedules in preemptive shop scheduling, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, How useful are preemptive schedules?, Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Normal-form preemption sequences for an open problem in scheduling theory, Integer preemptive scheduling on parallel machines, The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints, A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time, How small are shifts required in optimal preemptive schedules?, Integrality Property in Preemptive Parallel Machine Scheduling
Cites Work
- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling with Deadlines and Loss Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
