Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget

DOI10.1007/978-3-642-21204-8_27MaRDI QIDQ3004675zbMATH OpenOpenAlexFDO

Authors Lin Chen, Wenchang Luo, Guochuan Zhang

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

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

Recommendations

• Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
• An absolute approximation algorithm for scheduling unrelated machines
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Approximation schemes for scheduling and covering on unrelated machines
• Approximate algorithms for unrelated machine scheduling to minimize makespan
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
• Approximation schemes for parallel machine scheduling with non-renewable resources
• Improved approximation schemes for scheduling unrelated parallel machines

Cites work

• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Approximation algorithms for scheduling unrelated parallel machines
• Approximation schemes for scheduling on parallel machines
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• Machine scheduling with resource dependent processing times
• Speed scaling of tasks with precedence constraints
• Task Scheduling in Networks

Cited in

(4)

• Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
• Scheduling under a non-reversible energy source: an application of piecewise linear bounding of non-linear demand/cost functions
• Approximate algorithms for unrelated machine scheduling to minimize makespan
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004675)