Approximation schemes for robust makespan scheduling problems

DOI10.1007/978-3-319-28697-6_46MaRDI QIDQ2806953zbMATH OpenOpenAlexFDO

Authors Adam Kurpisz

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_46

zbMATH Keywords

polynomial optimizationflow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47)

Recommendations

• Approximation schemes for scheduling on parallel machines
• Makespan minimization in job shops: a polynomial time approximation scheme
• Improved approximation schemes for scheduling unrelated parallel machines
• Approximation algorithms for scheduling unrelated parallel machines
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

Cites work

• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Grouping techniques for scheduling problems: simpler and faster
• On Multidimensional Packing Problems
• Online vector scheduling and generalized load balancing

Cited in

(6)

• Closing the gap for makespan scheduling via sparsification techniques
• Approximation schemes for machine scheduling
• scientific article; zbMATH DE number 6820261 (Why is no real title available?)
• Approximation results for makespan minimization with budgeted uncertainty
• Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
• Minimizing worst-case and average-case makespan over scenarios

This page was built for publication: Approximation schemes for robust makespan scheduling problems

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