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...

Celý popis

Podrobná bibliografie

Vydáno v:	Theoretical computer science Ročník 922; s. 438 - 446
Hlavní autoři:	Tong, Weitian, Xu, Yao, Zhang, Huili
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 24.06.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!