An FPTAS for the parallel two-stage flowshop problem

We consider the NP-hard m-parallel two-stage flowshop problem, abbreviated as the (m,2)-PFS problem, where we need to schedule n jobs to m parallel identical two-stage flowshops in order to minimize the makespan, i.e. the maximum completion time of all the jobs on the m flowshops. The (m,2)-PFS prob...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 657; S. 64 - 72
Hauptverfasser:	Dong, Jianming, Tong, Weitian, Luo, Taibo, Wang, Xueshi, Hu, Jueliang, Xu, Yinfeng, Lin, Guohui
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 02.01.2017
Schlagworte:	Dynamic programming Fully polynomial-time approximation scheme Makespan Multiprocessor scheduling Two-stage flowshop scheduling Multiprocessor scheduling Fully polynomial-time approximation scheme Makespan Dynamic programming Two-stage flowshop scheduling
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!