Scheduling Flexible Production Lines with No Intermediate Buffers by Hybrid Algorithms

Abstract:

This paper is concerned about the scheduling problems in flexible production lines with no intermediate buffers. The optimization objective is to minimizing the makespan. The mathematical models are presented. Since the problem is NP-hard, a hybrid algorithm, based on genetic algorithm and tabu search, is put forward for solving the models. In this algorithm, the method of generating the initial population is proposed and the crossover and mutation operators, tabu list, and aspiration rule are newly designed. The performance of the hybrid algorithm is compared with that of the traditional genetic algorithm. The computational results show that satisfactory solutions can be obtained by the hybrid algorithm and it performs better than the genetic algorithm in terms of solution quality.

• Periodical: Advanced Materials Research (Volumes 557-559)
• Pages: 2229-2233
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.557-559.2229
• Online since: July 2012
• Authors: Bing Gang Wang
• Keywords: Buffer, Flexible Production Lines, Hybrid Algorithm, Scheduling

References

[1] I. Khosla. European Journal of Operational Research Vol. 84 (1995), pp.330-42.

[2] E. Nowicki. European Journal of Operational Research Vol. 116 (1999), pp.205-219.

[3] B.A. Norman. Computers & Industrial Engineering Vol 36 (1999), pp.163-77.

[4] L. Wang, L. Zhang, D.Z. Zheng. Computers & Operations Research Vol 33 (2006), pp.2960-2971.

[5] R. Leisten. International Journal of Production Research Vol 28 (1990), pp.2085-2100.

[6] B. Qian, L. Wang, D. Huang, W. Wang, X. Wang. Computer & Operations Research Vol 36 ( 2009), pp.209-233.

[7] L. Wang, D.Z. Zheng. International Journal of Advanced Manufacturing Technology Vol 21(1) (2003), pp.38-44.