Scheduling two-stage jobs on multiple flowshops

• Published in: Theoretical computer science Vol. 776; pp. 117 - 124
• Main Authors: Wu, Guangwei, Chen, Jianer, Wang, Jianxin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 12.07.2019
• Subjects: Algorithm; Cloud computing; Scheduling; Two-stage flowshop; Two-stage flowshop; Cloud computing; Scheduling; Algorithm
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2019.01.017

Scheduling two-stage jobs on multiple two-stage flowshops is studied. A new formulation for configurations of the scheduling is proposed, leading directly to improvements on complexity of scheduling algorithms for the problem. Motivated by observations in practice, we present a deeper study on the structures of the problem that leads to a new approach that gives very significant improved scheduling algorithms for the problem when the costs of the two stages differ significantly. •The paper studies scheduling two-stage jobs on multiple two-stage flowshops.•Based on a new formulation for the configuration of flowshop, a new improved exact algorithm is proposed.•An improved algorithm for a special case is developed when the costs of the two stages differ significantly.•An improved FPTAS for the problem is developed, when the number of flowshops is fixed.