Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

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. (c) 2005 Elsevier Ltd. All rights reserved.