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-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.
- Approximation algorithms
ASJC Scopus subject areas
- Computational Theory and Mathematics