Minimizing worst-case and average-case makespan over scenarios

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

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

2 Downloads (Pure)


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 scenarios in an explicitly given set. Each scenario is a subset of jobs that must be executed in that scenario. 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 lower bounds on their approximability. We also consider some (easier) special cases. Combinatorial optimization problems under scenarios in general, and scheduling problems under scenarios in particular, have seen only limited research attention so far. With this paper, we make a step in this interesting research direction.

Original languageEnglish
Pages (from-to)545-555
Number of pages11
JournalJournal of Scheduling
Issue number6
Early online date17 Jun 2016
Publication statusPublished - Dec 2017


  • Approximation algorithm
  • Job scheduling
  • Makespan
  • Scenarios


Dive into the research topics of 'Minimizing worst-case and average-case makespan over scenarios'. Together they form a unique fingerprint.

Cite this