An absolute approximation algorithm for scheduling unrelated machines

DOI10.1002/NAV.20157MaRDI QIDQ3423277zbMATH OpenOpenAlexFDO

Authors Nodari Vakhania, Evgeny V. Shchepin

Publication date 20 February 2007

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.20157

zbMATH Keywords

absolute errorapproximation algorithmschedulingunrelated machines

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for scheduling unrelated parallel machines
• An optimal rounding gives a better approximation for scheduling unrelated machines
• scientific article; zbMATH DE number 1759466
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

Cited in

(8)

• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
• On the Configuration-LP for Scheduling on Unrelated Machines
• scientific article; zbMATH DE number 1759466 (Why is no real title available?)
• Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
• Approximate algorithms for unrelated machine scheduling to minimize makespan
• Approximation algorithms for scheduling unrelated parallel machines

This page was built for publication: An absolute approximation algorithm for scheduling unrelated machines

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