Stochastic Machine Scheduling with Prcedence Constraints

M. Skutella; M.J. Uetz

doi:10.1137/S0097539702415007

Stochastic Machine Scheduling with Prcedence Constraints

M. Skutella^*, M.J. Uetz

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We consider parallel, identical machine scheduling problems, where the jobs are subject to precedence constraints and release dates, and where the processing times of jobs are governed by independent probability distributions. Our objective is to minimize the expected value of the total weighted completion time. Building upon a linear programming relaxation by Mohring, Schulz, and Uetz [ J. ACM, 46 ( 1999), pp. 924 - 942] and a delayed list scheduling algorithm by Chekuri et al. [SIAM J. Comput., 31 ( 2001), pp. 146 - 166], we derive the first constant-factor approximation algorithms for this model.

Original language	English
Pages (from-to)	788-802
Number of pages	15
Journal	Siam Journal on Computing
Volume	34
Issue number	4
DOIs	https://doi.org/10.1137/S0097539702415007
Publication status	Published - 1 Jan 2005

Access to Document

10.1137/S0097539702415007

Cite this

@article{500041777896424a8a79299dc456fb59,

title = "Stochastic Machine Scheduling with Prcedence Constraints",

abstract = "We consider parallel, identical machine scheduling problems, where the jobs are subject to precedence constraints and release dates, and where the processing times of jobs are governed by independent probability distributions. Our objective is to minimize the expected value of the total weighted completion time. Building upon a linear programming relaxation by Mohring, Schulz, and Uetz [ J. ACM, 46 ( 1999), pp. 924 - 942] and a delayed list scheduling algorithm by Chekuri et al. [SIAM J. Comput., 31 ( 2001), pp. 146 - 166], we derive the first constant-factor approximation algorithms for this model.",

author = "M. Skutella and M.J. Uetz",

year = "2005",

month = jan,

day = "1",

doi = "10.1137/S0097539702415007",

language = "English",

volume = "34",

pages = "788--802",

journal = "Siam Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Stochastic Machine Scheduling with Prcedence Constraints

AU - Skutella, M.

AU - Uetz, M.J.

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We consider parallel, identical machine scheduling problems, where the jobs are subject to precedence constraints and release dates, and where the processing times of jobs are governed by independent probability distributions. Our objective is to minimize the expected value of the total weighted completion time. Building upon a linear programming relaxation by Mohring, Schulz, and Uetz [ J. ACM, 46 ( 1999), pp. 924 - 942] and a delayed list scheduling algorithm by Chekuri et al. [SIAM J. Comput., 31 ( 2001), pp. 146 - 166], we derive the first constant-factor approximation algorithms for this model.

AB - We consider parallel, identical machine scheduling problems, where the jobs are subject to precedence constraints and release dates, and where the processing times of jobs are governed by independent probability distributions. Our objective is to minimize the expected value of the total weighted completion time. Building upon a linear programming relaxation by Mohring, Schulz, and Uetz [ J. ACM, 46 ( 1999), pp. 924 - 942] and a delayed list scheduling algorithm by Chekuri et al. [SIAM J. Comput., 31 ( 2001), pp. 146 - 166], we derive the first constant-factor approximation algorithms for this model.

U2 - 10.1137/S0097539702415007

DO - 10.1137/S0097539702415007

M3 - Article

SN - 0097-5397

VL - 34

SP - 788

EP - 802

JO - Siam Journal on Computing

JF - Siam Journal on Computing

IS - 4

ER -