3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present 3 (2) over bar -approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results. (C) 2003 Elsevier B.V. All rights reserved.
scheduling approximation algorithms