.png){kind=icon}
Return
Approximation algorithms for the parallel flow shop problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2011.08.007.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the N/P-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson's rule. For m = 2, we present a 3/2-approximation algorithm, and for m = 3, we present a 12/7-approximation algorithm. Both these algorithms run in O(n log n) time. These are the first approximation algorithms with fixed worst-case performance guarantees for the parallel flow shop problem. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Scheduling
Parallel flow shop
Hybrid flow shop
Approximation algorithms
Worst-case analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
ShareSaveShareSaveShareSave
Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions.png)
EXPERT SYSTEMS
EXPERT SYSTEMSIF2.3
PREAI
ShareSave
View more