Minimizing worst-case and average-case makespan over scenarios

  • Esteban Feuerstein
  • Alberto Marchetti-Spaccamela
  • Frans Schalekamp
  • René Sitters
  • Suzanne van der Ster
  • Leen Stougie
  • Anke van Zuylen
Article

DOI: 10.1007/s10951-016-0484-y

Cite this article as:
Feuerstein, E., Marchetti-Spaccamela, A., Schalekamp, F. et al. J Sched (2016). doi:10.1007/s10951-016-0484-y
  • 125 Downloads

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.

Keywords

Job scheduling Approximation algorithm Makespan Scenarios 

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Esteban Feuerstein
    • 1
  • Alberto Marchetti-Spaccamela
    • 2
  • Frans Schalekamp
    • 3
  • René Sitters
    • 4
  • Suzanne van der Ster
    • 5
  • Leen Stougie
    • 4
  • Anke van Zuylen
    • 6
  1. 1.Universidad de Buenos AiresBuenos AiresArgentina
  2. 2.Sapienza Università di RomaRomeItaly
  3. 3.Cornell UniversityIthacaUSA
  4. 4.Vrije Universiteit & CWIAmsterdamThe Netherlands
  5. 5.Technische Universität MünchenMunichGermany
  6. 6.College of William and MaryWilliamsburgUSA

Personalised recommendations