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.
Minimizing worst-case and average-case makespan over scenarios / Feuerstein, Esteban; MARCHETTI SPACCAMELA, Alberto; Schalekamp, Frans; Sitters, René; van der Ster, Suzanne; Stougie, Leen; van Zuylen, Anke. - In: JOURNAL OF SCHEDULING. - ISSN 1094-6136. - STAMPA. - 20:6(2017), pp. 545-555. [10.1007/s10951-016-0484-y]
Minimizing worst-case and average-case makespan over scenarios
MARCHETTI SPACCAMELA, Alberto;
2017
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
Feuerstein_Preprint_Minimizing-Worst-case_2017.pdf
accesso aperto
Note: https://link.springer.com/article/10.1007/s10951-016-0484-y
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
272.55 kB
Formato
Adobe PDF
|
272.55 kB | Adobe PDF | |
Feuerstein_Minimizing-Worst-case_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
430.02 kB
Formato
Adobe PDF
|
430.02 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.