Scheduling over Scenarios on Two Machines

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

DOI: 10.1007/978-3-319-08783-2_48

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8591)
Cite this paper as:
Feuerstein E. et al. (2014) Scheduling over Scenarios on Two Machines. In: Cai Z., Zelikovsky A., Bourgeois A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham

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 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 lower bounds on their approximability. With this research into optimization problems over scenarios, we have opened a new and rich field of interesting problems.

Keywords

job scheduling makespan minimization scenarios approximation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Esteban Feuerstein
    • 1
  • Alberto Marchetti-Spaccamela
    • 2
  • Frans Schalekamp
    • 3
  • René Sitters
    • 4
    • 5
  • Suzanne van der Ster
    • 4
  • Leen Stougie
    • 4
    • 5
  • Anke van Zuylen
    • 3
  1. 1.Departamento de ComputaciónFCEyN, UBABuenos AiresArgentina
  2. 2.Sapienza University of RomeItaly
  3. 3.Department of MathematicsCollege of William and MaryWilliamsburgUSA
  4. 4.Vrije Universiteit AmsterdamThe Netherlands
  5. 5.CWI AmsterdamThe Netherlands

Personalised recommendations