Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

DOI10.1007/S10951-016-0476-YMaRDI QIDQ2398640zbMATHOpenAlexFDO

Authors Leah Epstein, Ido Yatsiv

Publication date 18 August 2017

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-016-0476-y

zbMATH Keywords

preemptive schedulinguniformly related machinesmakespan completion times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Preemptive scheduling on uniform machines to minimize mean flow time
• Online scheduling of two uniform machines to minimize total completion times
• On-line preemptive scheduling on uniform machines
• Optimal and online preemptive scheduling on uniformly related machines
• STACS 2004

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• scientific article; zbMATH DE number 1757970 (Why is no real title available?)
• A Level Algorithm for Preemptive Scheduling
• Minimizing makespan and preemption costs on a system of uniform machines
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimal and online preemptive scheduling on uniformly related machines
• Optimal preemptive scheduling for general target functions
• Preemptive Scheduling of Uniform Processor Systems
• Scheduling independent tasks to reduce mean finishing time
• Scheduling with deadlines and loss functions
• Technical Note—Minimizing Average Flow Time with Parallel Machines

Cited in

(2)

• Fair scheduling via iterative quasi-uniform sampling
• Complexity of preemptive minsum scheduling on unrelated parallel machines

This page was built for publication: Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

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