Scheduling over Scenarios on Two Machines [article]

Esteban Feuerstein, Alberto Marchetti-Spaccamela, Frans Schalekamp, Rene Sitters, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
2014 arXiv   pre-print
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all possible scenarios. Each scenario is a subset of jobs that must be executed in that scenario and all scenarios are given explicitly. The two objectives that we consider are minimizing the maximum makespan over all scenarios and minimizing the sum of the makespans of all scenarios. For both versions, we give several approximation algorithms and
more » ... r bounds on their approximability. With this research into optimization problems over scenarios, we have opened a new and rich field of interesting problems.
arXiv:1404.4766v1 fatcat:a5ufdkvpvncy3fs2mouafgjudm