Off-line temporary tasks assignment.

DOI10.1016/S0304-3975(01)00254-7zbMath1061.90043MaRDI QIDQ1853487

Yossi Azar, Oded Regev, Jiří Sgall, Gerhard J. Woeginger

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Load balancing of temporary tasks in the \(\ell _{p}\) norm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Online algorithms. The state of the art
• Algorithms for Scheduling Independent Tasks
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• On-Line Load Balancing of Temporary Tasks on Identical Machines
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies