Integer preemptive scheduling on parallel machines

DOI10.1016/J.ORL.2012.06.011MaRDI QIDQ1939681zbMATH OpenOpenAlexFDO

Authors Philippe Baptiste, Jacques Carlier, Maurice Queyranne, Alexander Kononov, Sergey Sevastyanov, Maxim Sviridenko

Publication date 5 March 2013

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

Full work available at URL https://doi.org/10.1016/j.orl.2012.06.011

zbMATH Keywords

parallel machinesstructural propertiespreemptive scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
• Preemptive scheduling with deadlines on parallel machines
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• scientific article; zbMATH DE number 871911
• Preemptive Scheduling of Hybrid Parallel Machines
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Scheduling preemptive jobs with precedence constraints on parallel machines
• Preemptive scheduling on identical parallel machines subject to deadlines.
• scientific article; zbMATH DE number 6263704

Cites work

• scientific article; zbMATH DE number 724323 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 3433334 (Why is no real title available?)
• How useful are preemptive schedules?
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• On preemption redundancy in scheduling unit processing time jobs on two parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Properties of optimal schedules in preemptive shop scheduling
• Scheduling chain-structured tasks to minimize makespan and mean flow time
• Structural properties of optimal schedules with preemption
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time

Cited in

(10)

• Rational preemptive scheduling
• scientific article; zbMATH DE number 6263704 (Why is no real title available?)
• Synchronous flow shop scheduling with pliable jobs
• Integer models for the interrupt-oriented services of jobs by single machine
• Preemptive scheduling on a small number of hierarchical machines
• Properties of optimal schedules in preemptive shop scheduling
• Integrality Property in Preemptive Parallel Machine Scheduling
• Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
• Structural properties of optimal schedules with preemption
• Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines

This page was built for publication: Integer preemptive scheduling on parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1939681)