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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research Jg. 40; H. 1-supplement-1; S. S67 - S75
Hauptverfasser:	Coffman, E. G., Liu, Zhen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Linthicum, MD INFORMS 01.01.1992 Operations Research Society of America Institute for Operations Research and the Management Sciences
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!