Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9662260 | Computers & Mathematics with Applications | 2005 | 10 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jinxing Xie, Xijun Wang,