Three stages flow-shop with job over-passing

In practical task scheduling it is sometimes required that the components of a system perform consecutively. Such scheduling is called without no-idle periods. In this paper, we study a particular case of three workshops where the no-idle constraint is applied only on the second stage. A heuristic is proposed and experimented. This work is then extended and tested for a larger size of problems.