Improved approximation algorithms for scheduling with fixed jobs

MaRDI QIDQ4633879zbMATH OpenFDO

Authors Florian Diedrich, Klaus Jansen

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496844

Mathematics Subject Classification ID

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

Recommendations

• Tight approximation algorithms for scheduling with fixed jobs and nonavailability
• Approximability of scheduling with fixed jobs
• scientific article; zbMATH DE number 1512677
• Approximation schemes for scheduling with availability constraints
• Approximation algorithms for scheduling with reservations

Cited in

(5)

• Approximability of scheduling with fixed jobs
• Minimizing total weighted completion time with an unexpected machine unavailable interval
• Approximation schemes for parallel machine scheduling with availability constraints
• Tight approximation algorithms for scheduling with fixed jobs and nonavailability
• Scheduling partially ordered jobs faster than \(2^n\)

This page was built for publication: Improved approximation algorithms for scheduling with fixed jobs

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