Algorithms to minimize completion time variance in a two machine flowshop

This paper presents algorithms to minimize the variance of completion time (CTV) when n jobs have to be processed on two machines. All the jobs visit the machines in the same order or technological sequence. These algorithms are applicable in manufacturing systems where both the facilities could be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering 1998-10, Vol.35 (1-2), p.101-104
Hauptverfasser:	Marangos, Charalambos A., Govande, Vinay, Srinivasan, G., Zimmers, Emory W.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Exact sciences and technology Heuristic Inventory control, production control. Distribution Job shops Operational research and scientific management Operational research. Management science Production scheduling Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!