Minimizing worst-case and average-case makespan over scenarios
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.
|Journal||Journal of Scheduling|
Feuerstein, E, Marchetti Spaccamela, A, Schalekamp, F, Sitters, R.A, van der Ster, S.L, Stougie, L, & van Zuylen, A. (2017). Minimizing worst-case and average-case makespan over scenarios. Journal of Scheduling, 20(6), 545–555. doi:10.1007/s10951-016-0484-y