1. Wu, C., Gu, X.: A genetic algorithm for flow shop scheduling with fuzzy processing time and due date. In: Proceedings of 5th World Congress on Control and Automation, pp. 2983–2942 (June 2004)
2. Kalir, A.A., Sarin, S.C.: A near-optimal heuristic for the sequence problem in multiple-batch flow –shops with small equal stublots. Omega 29, 577–584 (2001)
3. Dou, J., Li, J.: Adiscrete particle swarm algorithm foe makespan minimization in the permutation flowsshop scheduling problem. In: Proc. IEEE International Conference on Evolutionary Computation, pp. 69–73 (2013)
4. Lecture Notes in Computer Science;M Fatih Tasgetiren,2004
5. Han, Y.-Y., Duan, J.-H., Zhang, M.: Apply the discrete artifical bee colony algorithm to the blocking flow shop problem with makespan criterion. In: Chinese Control and Decision Conference (CCDC), pp. 2135–2139 (2011)