A PTAS for scheduling unrelated machines of few different types

DOI10.1007/978-3-662-49192-8_24MaRDI QIDQ5890526zbMATH OpenOpenAlexFDO

Authors Jan Clemens Gehrke, Stefan E. J. Kraft, Jakob Schikowski, Klaus Jansen

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://macau.uni-kiel.de/receive/macau_mods_00002002

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

• A PTAS for scheduling unrelated machines of few different types
• A PTAS for the average weighted completion time problem on unrelated machines.
• Improved approximation schemes for scheduling unrelated parallel machines

Cited in

(4)

• A family of scheduling algorithms for hybrid parallel platforms
• A PTAS for scheduling unrelated machines of few different types
• A unified framework for designing EPTAS for load balancing on parallel machines
• Quantum annealing to solve the unrelated parallel machine scheduling problem

This page was built for publication: A PTAS for scheduling unrelated machines of few different types

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