New Old Algorithms for Stochastic Scheduling

Author Andreas S. Schulz



PDF
Thumbnail PDF

File

DagSemProc.05031.18.pdf
  • Filesize: 139 kB
  • 9 pages

Document Identifiers

Author Details

Andreas S. Schulz

Cite AsGet BibTex

Andreas S. Schulz. New Old Algorithms for Stochastic Scheduling. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05031.18

Abstract

We consider the stochastic identical parallel machine scheduling problem and its online extension, when the objective is to minimize the expected total weighted completion time of a set of jobs that are released over time. We give randomized as well as deterministic online and offline algorithms that have the best known performance guarantees in either setting, online or offline and deterministic or randomized. Our analysis is based on a novel linear programming relaxation for stochastic scheduling problems that can be solved online.
Keywords
  • stochastic scheduling
  • online algorithms
  • competitive analysis
  • approximation algorithms
  • linear programming relaxations

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail