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

DOI10.1007/S10951-016-0476-YzbMATH Open1373.90056OpenAlexW2331808886MaRDI QIDQ2398640FDOQ2398640

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

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

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)

Cites Work

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

Cited In (1)

• 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)