1. Flow-shop/no-idle or no-wait scheduling to minimise the sum of completion times;Adiri;Naval, Research Quarterly,1982
2. Antethic sequences in flow shop scheduling;Azim;Computer & industrial Engineering,1987
3. Baptiste, P., Hguny, L.K., 1997. A Branch and Bound Algorithm for the F=no-idle=C max. Proceedings of the International Conference on Industrial Engineering and Production Management (IEPM’97), vol. 1. Lyon, pp. 429–438.
4. Exact distribution of the makespan in a two machines Flow Shop with two kinds of jobs;Baptiste;International Journal of Production Economics,2001
5. A tabu search approach for the Flow Shop scheduling problem;Ben-Daya;European Journal of Operational Research,1998