On the Optimal Stochastic Scheduling of Out-Forests

This paper presents new results on the problem of scheduling jobs on K ≥ 1 parallel processors to stochastically minimize the makespan. The jobs are subject to out-forest precedence constraints, i.e., each job has at most one immediate predecessor, and job running times are independent samples from...

Full description

Saved in:

Bibliographic Details
Published in:	Operations research Vol. 40; no. 1-supplement-1; pp. S67 - S75
Main Authors:	Coffman, E. G., Liu, Zhen
Format:	Journal Article
Language:	English
Published:	Linthicum, MD INFORMS 01.01.1992 Operations Research Society of America Institute for Operations Research and the Management Sciences
Subjects:	Applied sciences Counterexamples Exact sciences and technology Forest conservation Job shops Mathematical analysis network/graphs: tree algorithms Operational research and scientific management Operational research. Management science Operations research Optimal policy Parallel processing Plant roots Probabilities production/scheduling: stochastic sequencing Random variables Roots of functions Scheduling Scheduling, sequencing Stochastic models Trees Tree(graph) Processor Forest(graph) Scheduling Graph theory Stochastic method Optimization
ISSN:	0030-364X, 1526-5463
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!