Tight approximation algorithms for scheduling with fixed jobs and nonavailability

DOI10.1145/2229163.2229171MaRDI QIDQ3189068zbMATH OpenOpenAlexFDO

Authors Florian Diedrich, Lars Prädel, Ulrich M. Schwarz, Ola Svensson, Klaus Jansen

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://macau.uni-kiel.de/servlets/MCRFileNodeServlet/macau_derivate_00002980/tr-0902-bericht.pdf

zbMATH Keywords

approximationoptimizationscheduling

Mathematics Subject Classification ID

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

Recommendations

• Improved approximation algorithms for scheduling with fixed jobs
• Approximation schemes for scheduling with availability constraints
• A fully polynomial time approximation scheme for makespan minimization problems on two machines with a fixed non-availability interval
• Approximation schemes for parallel machine scheduling with availability constraints
• Approximability of scheduling with fixed jobs

Cited in

(2)

• Improved approximation algorithms for scheduling with fixed jobs
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals

This page was built for publication: Tight approximation algorithms for scheduling with fixed jobs and nonavailability

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