Title of article
Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints
Author/Authors
Jinxing Xie، نويسنده , , Xijun Wang، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2005
Pages
10
From page
1629
To page
1638
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
Approximability , Approximation algorithms , Worst-case analysis , Availability constraints , Scheduling , Flexible flowshop
Journal title
Computers and Mathematics with Applications
Serial Year
2005
Journal title
Computers and Mathematics with Applications
Record number
920383
Link To Document