On preemption redundancy in scheduling unit processing time jobs on two parallel machines

DOI10.1016/S0167-6377(01)00068-2zbMath0992.90026MaRDI QIDQ5945391

Timkovsky, Vadim G., Philippe Baptiste

Publication date: 22 September 2002

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

scheduling; parallel machines

Mathematics Subject Classification ID

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?, Integer preemptive scheduling on parallel machines, 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