Approximation Schemes for Robust Makespan Scheduling Problems

DOI10.1007/978-3-319-28697-6_46zbMath1342.90065OpenAlexW2460248264MaRDI QIDQ2806953

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

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

Related Items (1)

Approximation results for makespan minimization with budgeted uncertainty

Cites Work

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

This page was built for publication: Approximation Schemes for Robust Makespan Scheduling Problems