Getting rid of stochasticity: applicable sometimes

Hoogeveen, Han; Van den Akker, Marjan

doi:10.4230/DagSemProc.05031.12

License:

Creative Commons Attribution 4.0 license (CC BY 4.0)
when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05031.12
URN: urn:nbn:de:0030-drops-1924
URL: https://drops.dagstuhl.de/opus/volltexte/2005/192/

Hoogeveen, Han ; Van den Akker, Marjan

Getting rid of stochasticity: applicable sometimes

pdf-format:

05031.HoogeveenHan.ExtAbstract.192.pdf (0.1 MB)

Abstract

We consider the single-machine scheduling problem of minimizing the
number of late jobs. This problem is well-studied and well-understood in case of deterministic processing times. We consider the problem with stochastic processing times, and we show that for a number of probability distributions the problem can be reformulated as a deterministic problem (and solved by the corresponding algorithm) when we use the concept of minimum success probabilities, which is, that we require that the probability that a job complete on time is `big enough'. We further show that we can extend our approach to the case of machines with stochastic output.

BibTeX - Entry

@InProceedings{hoogeveen_et_al:DagSemProc.05031.12,
  author =	{Hoogeveen, Han and Van den Akker, Marjan},
  title =	{{Getting rid of stochasticity: applicable sometimes}},
  booktitle =	{Algorithms for Optimization with Incomplete Information},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5031},
  editor =	{Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2005/192},
  URN =		{urn:nbn:de:0030-drops-1924},
  doi =		{10.4230/DagSemProc.05031.12},
  annote =	{Keywords: Scheduling , sequencing , single machine , number of late jobs , stochastic processing times , minimum success probability , dynamic programming unreliable machines}
}

17.06.2005

Keywords: Scheduling , sequencing , single machine , number of late jobs , stochastic processing times , minimum success probability , dynamic programming

Freie Schlagwörter (deutsch): unreliable machines

Seminar: 05031 - Algorithms for Optimization with Incomplete Information

Issue date: 2005

Date of publication: 17.06.2005

Keywords:		Scheduling , sequencing , single machine , number of late jobs , stochastic processing times , minimum success probability , dynamic programming
Freie Schlagwörter (deutsch):		unreliable machines
Seminar:		05031 - Algorithms for Optimization with Incomplete Information
Issue date:		2005
Date of publication:		17.06.2005