Preemptive scheduling on identical parallel machines subject to deadlines.

DOI10.1016/S0377-2217(02)00374-0zbMath1037.90021OpenAlexW2023013850MaRDI QIDQ1810503

Azizoglu, Meral

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

Preemptive schedulingTotal completion timeParallel machines

Mathematics Subject Classification ID

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

Related Items (2)

A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preemptive scheduling to minimize mean weighted flow time
• Minimizing mean flow time with release time constraint
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Scheduling independent tasks to reduce mean finishing time

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