Parallel Machine Scheduling under Uncertainty

DOI10.1007/978-3-642-31724-8_9zbMath1252.90025OpenAlexW34185299MaRDI QIDQ3143637

Adam Kasperski, Paweł Zieliński, Adam Kurpisz

Publication date: 3 December 2012

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31724-8_9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Online makespan minimization with budgeted uncertainty ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Bin packing problem with scenarios ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ Minimizing worst-case and average-case makespan over scenarios ⋮ Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations ⋮ Approximation results for makespan minimization with budgeted uncertainty

This page was built for publication: Parallel Machine Scheduling under Uncertainty