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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 922; pp. 438 - 446
Main Authors:	Tong, Weitian, Xu, Yao, Zhang, Huili
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 24.06.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!