Optimizing Pull Production Systems with Cost Objectives by Modified Memetic Algorithm

Abstract:

This paper is concerned about the sequencing problems in pull production systems consisting of one mixed-model assembly line with limited intermediate buffers and one fabrication flow line with limited intermediate buffers. The optimization objective is to minimizing the total makespan cost in the whole production system. The mathematical models and, considering the safety inventory of the demanded parts, the method to determine the production sequences for the fabrication line according to the production sequences for the mixed-model assembly line are presented. Since the problem is NP-hard, a modified memetic algorithm is proposed for solving the models. In this algorithm, the method of generating the initial population, the local search procedures, the selection, crossover and mutation operators are newly designed. Optimization results are compared between the algorithm proposed in this paper and the traditional genetic algorithm. The feasibility and efficiency of the modified memetic algorithm is shown by the comparison results.

• Periodical: Advanced Materials Research (Volumes 472-475)
• Pages: 3331-3334
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.472-475.3331
• Online since: February 2012
• Authors: Bing Gang Wang
• Keywords: Buffer, Genetic Algorithm (GA), Memetic Algorithm, Optimizing, Pull Production System

References

[1] T.C.E Cheng, G. Wang. IIE Transactions Vol. 31(2) (1999), pp.135-143.

[2] B.M.T Lin, T.C.E Cheng. IIE Transactions Vol. 34(11) (2002), pp.1015-1020.

[3] M. Yokoyama. International Journal of Production Economics Vol. 73(2) (2001), pp.103-116.

[4] M. Yokoyama, D.L. Santos. European Journal of Operational Research Vol. 161(3) (2005), pp.754-770.

[5] M. Yokoyama. European Journal of Operational Research Vol. 187 (2008), pp.1184-1195.

[6] B. Wang. Chinese Journal of Mechanical Engineering Vol. 25(5) (2010), pp.537-546.