Stochastic scheduling to minimize expected maximum lateness

This paper is concerned with the problems in scheduling a set of jobs associated with random due dates on a single machine so as to minimize the expected maximum lateness in stochastic environment. This is a difficult problem and few efforts have been reported on its solution in the literature. In t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	European journal of operational research Jg. 190; H. 1; S. 103 - 115
Hauptverfasser:	Wu, Xianyi, Zhou, Xian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.10.2008 Elsevier Elsevier Sequoia S.A
Schriftenreihe:	European Journal of Operational Research
Schlagworte:	Applied sciences Due dates Dynamic programming Dynamic programming algorithms Exact sciences and technology Expected maximum lateness Heuristic Job shops Operational research and scientific management Operational research. Management science Scheduling algorithms Scheduling, sequencing Solutions Stochastic models Stochastic scheduling Studies Dynamic programming algorithms Stochastic scheduling Expected maximum lateness Due dates Probabilistic approach Processing time Scheduling Due date Stochastic programming Heuristic method Lateness Dynamic programming Single machine Execution time
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!