A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investigate the scheduling of parallel two-stage flowshops under makespan constraint, which was motivated by applications in cloud computing and introduced by Chen et al. [3] recently. A set of two-stage job...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 922; S. 438 - 446
Hauptverfasser:	Tong, Weitian, Xu, Yao, Zhang, Huili
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 24.06.2022
Schlagworte:	Makespan constraint Multiple knapsacks Parallel two-stage flowshops Polynomial-time approximation scheme Rounding Multiple knapsacks Rounding Polynomial-time approximation scheme Makespan constraint Parallel two-stage flowshops
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!