An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
From MaRDI portal
Publication:2775886
DOI10.1006/jagm.2001.1184zbMath1051.68150OpenAlexW2012989825MaRDI QIDQ2775886
Chandra Chekuri, Michael A. Bender
Publication date: 8 July 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1184
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Scheduling algorithms for procrastinators ⋮ Towards Tight Lower Bounds for Scheduling Problems ⋮ Scheduling on unrelated machines under tree-like precedence constraints ⋮ Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search ⋮ Decentralized list scheduling ⋮ An improved monotone algorithm for scheduling related machines with precedence constraints ⋮ Optimizing performance and reliability on heterogeneous parallel systems: approximation algorithms and heuristics ⋮ Speed scaling of tasks with precedence constraints ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS ⋮ Power-aware scheduling for makespan and flow
