Journal
COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume 50, Issue 10-12, Pages 1629-1638Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.camwa.2005.07.008
Keywords
scheduling; flexible flowshop; availability constraints; approximability; approximation algorithms; worst-case analysis
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
