Scheduling over Scenarios on Two Machines

DOI10.1007/978-3-319-08783-2_48zbMath1425.90042arXiv1404.4766OpenAlexW2157721290MaRDI QIDQ2920492

Frans Schalekamp, Suzanne Van der Ster, Anke van Zuylen, Esteban Feuerstein, R. A. Sitters, Alberto Marchetti-Spaccamela, Leen Stougie

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4766

zbMATH Keywords

approximationmakespan minimizationscenariosjob scheduling

Mathematics Subject Classification ID

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

Related Items (3)

$(2+\varepsilon)$-Sat Is NP-hard ⋮ A priori TSP in the Scenario Model ⋮ A priori TSP in the scenario model

This page was built for publication: Scheduling over Scenarios on Two Machines