Complexity and algorithms for two-stage
โ
Jinxing Xie; Xijun Wang
๐
Article
๐
2005
๐
Elsevier Science
๐
English
โ 519 KB
This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem