Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

Preemptive scheduling in open shops and flow shops so as to minimize the mean flow time are both known to be strongly NP-hard on three or more machines. However, their complexity on two machines remained open for more than a decade. In this paper we show that open shop is NP-hard in the ordinary sen...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms 1993, Vol.14 (1), p.24-44
Hauptverfasser:	Du, J.Z., Leung, J.Y.T.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Operational research and scientific management Operational research. Management science Scheduling, sequencing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!