Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget

DOI10.1007/978-3-642-21204-8_27zbMath1329.90055OpenAlexW26049317MaRDI QIDQ3004675

Lin Chen, Guo-Chuan Zhang, Wen-Chang Luo

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_27

zbMATH Keywords

approximation algorithmroundingunrelated machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (1)

Approximate algorithms for unrelated machine scheduling to minimize makespan

Cites Work

• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Machine scheduling with resource dependent processing times
• Speed scaling of tasks with precedence constraints
• Approximation schemes for scheduling on parallel machines
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Task Scheduling in Networks
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

This page was built for publication: Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget