Preemptive scheduling on identical parallel machines subject to deadlines.

DOI10.1016/S0377-2217(02)00374-0MaRDI QIDQ1810503zbMATH OpenOpenAlexFDO

Authors Meral Azizoğlu

Publication date 9 June 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(02)00374-0

zbMATH Keywords

Parallel machinesPreemptive schedulingTotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Preemptive scheduling with deadlines on parallel machines
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Preemptive Scheduling of Parallel Jobs on Multiprocessors
• scientific article; zbMATH DE number 871911
• Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
• Algorithms – ESA 2005
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
• Scheduling preemptive jobs with precedence constraints on parallel machines
• Preemptive and non-preemptive scheduling on two unrelated parallel machines

Cites work

• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Minimizing mean flow time with release time constraint
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Preemptive scheduling to minimize mean weighted flow time
• Scheduling independent tasks to reduce mean finishing time

Cited in

(18)

• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
• Integer preemptive scheduling on parallel machines
• New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
• A multi-objective optimization for preemptive identical parallel machines scheduling problem
• Parallel machine problems with equal processing times: a survey
• Optimal preemptive scheduling on a fixed number of identical parallel machines
• Preemptive scheduling with deadlines on parallel machines
• Minimizing total completion time on uniform machines with deadline constraints
• Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource
• An optimal algorithm for identical machine scheduling problem with preemption
• scientific article; zbMATH DE number 3902030 (Why is no real title available?)
• Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines
• Minimizing Total Completion Time on Parallel Machines with Deadline Constraints
• Preemptive scheduling with deadlines on a single machine
• Algorithms – ESA 2005
• Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
• An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem

This page was built for publication: Preemptive scheduling on identical parallel machines subject to deadlines.

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