New algorithms for related machines with temporary jobs.

DOI<259::AID-JOS47>3.0.CO;2-3 10.1002/1099-1425(200009/10)3:5<259::AID-JOS47>3.0.CO;2-3zbMath1153.90413MaRDI QIDQ1588054

Amotz Bar-Noy, Ari Freund, Joseph (Seffi) Naor

Publication date: 27 July 2003

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

A survey on makespan minimization in semi-online environments ⋮ Lower bounds for online makespan minimization on a small number of related machines ⋮ Online load balancing on uniform machines with limited migration ⋮ Optimal and online preemptive scheduling on uniformly related machines ⋮ A lower bound on deterministic online algorithms for scheduling on related machines without preemption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• A better lower bound for on-line scheduling
• Nonclairvoyant scheduling
• A lower bound for randomized on-line scheduling algorithms
• A lower bound for on-line scheduling on uniformly related machines
• Yet more on the linear search problem
• On-Line Load Balancing of Temporary Tasks
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: New algorithms for related machines with temporary jobs.