A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation

The paper deals with the classical problem of minimizing the makespan in a two-machine flow shop. When the job processing times are deterministic, the optimal job sequence can be determined by applying Johnson’s rule. When they are independent and exponential random variables, Talwar’s rule yields a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2006-03, Vol.169 (3), p.742-750
Hauptverfasser:	Kalczynski, Pawel Jan, Kamburowski, Jerzy
Format:	Artikel
Sprache:	eng
Schlagworte:	Coefficient of variation Expected makespan Flow shop Heuristic Job shops Operations research Production scheduling Random variables Stochastic scheduling Studies Weibull distribution
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!