全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Scheduling Mixed-Model Production on Multiple Assembly Lines with Shared Resources Using Genetic Algorithms: The Case Study of a Motorbike Company

DOI: 10.1155/2014/874031

Full-Text   Cite this paper   Add to My Lib

Abstract:

The authors deal with the topic of the final assembly scheduling realized by the use of genetic algorithms (GAs). The objective of the research was to study in depth the use of GA for scheduling mixed-model assembly lines and to propose a model able to produce feasible solutions also according to the particular requirements of an important Italian motorbike company, as well as to capture the results of this change in terms of better operational performances. The “chessboard shifting” of work teams among the mixed-model assembly lines of the selected company makes the scheduling problem more complex. Therefore, a complex model for scheduling is required. We propose an application of the GAs in order to test their effectiveness to real scheduling problems. The high quality of the final assembly plans with high adherence to the delivery date, obtained in a short elaboration time, confirms that the choice was right and suggests the use of GAs in other complex manufacturing systems. 1. Introduction Simulating the natural evolutionary process of human beings results in stochastic optimization techniques, called evolutionary algorithms, which can often outperform conventional methods when applied to complex real-world problems. Scheduling problems of manufacturing planning are a common example of complex problems where the interest in these groundbreaking techniques is growing among both scholars and practitioners. The paper examines a case study of a scheduling system for a mixed-model assembly lines [1], also referred to as the permutation flowshop scheduling problem. In such a production system, the managers want to sequence different products, thus obtaining a high service level (product mix) without delays in products delivery while respecting the constraints of capacity. The focus of the present work is the application of the genetic algorithms (GAs) as a technique for the resolution of such a complex problem. The paper is structured as follows. Section 2 depicts the principles and the successful characteristics of these techniques, providing an applicative model for their use in combinatory problems, in particular in the scheduling of final assembly phase of mixed-model assembly lines. We use the case study of an important Italian motorbike company as the outset of the study. Section 3 describes the company’s production system and the demand management logics. Afterwards, in Section 4, we propose a scheduling approach consisting of two stages, a macrostep and a microstep. The two steps, respectively, carry out a “macroscheduling” and a “microscheduling”

References

[1]  Y.-Y. Leu, L. A. Matheson, and L. P. Rees, “Sequencing mixed-model assembly lines with genetic algorithms,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 1027–1036, 1996.
[2]  S. G. Ponnambalam, P. Aravindan, and P. S. Rao, “Comparative evaluation of genetic algorithms for job-shop scheduling,” Production Planning & Control, vol. 12, no. 6, pp. 560–574, 2001.
[3]  D. Levine, “Genetic algorithms: a practitioner's view,” INFORMS Journal of Computing, vol. 9, no. 3, pp. 256–259, 1997.
[4]  K. Metaxiotis and J. Psarras, “The contribution of neural networks and genetic algorithms to business decision support: academic myth or practical solution?” Management Decision, vol. 42, no. 2, pp. 229–242, 2004.
[5]  J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975.
[6]  S. S. Chaudhry and W. Luo, “Application of genetic algorithms in production and operations management: a review,” International Journal of Production Research, vol. 43, no. 19, pp. 4083–4101, 2005.
[7]  S. Wadhwa, J. Madaan, and R. Raina, “A genetic algorithm based scheduling for a flexible system,” Global Journal of Flexible Systems Management, vol. 8, no. 3, pp. 15–24, 2007.
[8]  B. Kim and S. Kim, “Application of genetic algorithms for scheduling batch-discrete production system,” Production Planning and Control, vol. 13, no. 2, pp. 155–165, 2002.
[9]  P. Pongcharoen, C. Hicks, P. M. Braiden, and D. J. Stewardson, “Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products,” International Journal of Production Economics, vol. 78, no. 3, pp. 311–322, 2002.
[10]  F. Della Croce, R. Tadei, and G. Volta, “A genetic algorithm for the job shop problem,” Computers and Operations Research, vol. 22, no. 1, pp. 15–24, 1995.
[11]  S. G. Ponnambalam, V. Ramkumar, and N. Jawahar, “A multiobjective genetic algorithm for job shop scheduling,” Production Planning and Control, vol. 12, no. 8, pp. 764–774, 2001.
[12]  J. Yu, Y. Yin, and Z. Chen, “Scheduling of an assembly line with a multi-objective genetic algorithm,” International Journal of Advanced Manufacturing Technology, vol. 28, no. 5-6, pp. 551–555, 2006.
[13]  X. Shao, B. Wang, Y. Rao, L. Gao, and C. Xu, “Metaheuristic approaches to sequencing mixed-model fabrication/assembly systems with two objectives,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 9–12, pp. 1159–1171, 2010.
[14]  S. G. Ponnambalam, P. Aravindan, and S. Chandrasekaran, “Constructive and improvement flow shop scheduling heuristics: an extensive evaluation,” Production Planning and Control, vol. 12, no. 4, pp. 335–344, 2001.
[15]  T. Murata, H. Ishibuchi, and H. Tanaka, “Genetic algorithms for flowshop scheduling problems,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 1061–1071, 1996.
[16]  T. Murata, H. Ishibuchi, and H. Tanaka, “Multi-objective genetic algorithm and its applications to flowshop scheduling,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 957–968, 1996.
[17]  R. Ruiz, C. Maroto, and J. Alcaraz, “Two new robust genetic algorithms for the flowshop scheduling problem,” Omega, vol. 34, no. 5, pp. 461–476, 2006.
[18]  C. J. Hyun, Y. Kim, and Y. K. Kim, “A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines,” Computers and Operations Research, vol. 25, no. 7-8, pp. 675–690, 1998.
[19]  S. G. Ponnambalam, P. Aravindan, and M. Subba Rao, “Genetic algorithms for sequencing problems in mixed model assembly lines,” Computers and Industrial Engineering, vol. 45, no. 4, pp. 669–690, 2003.
[20]  R. Ruiz and C. Maroto, “A comprehensive review and evaluation of permutation flowshop heuristics,” European Journal of Operational Research, vol. 165, no. 2, pp. 479–494, 2005.
[21]  G. Celano, S. Fichera, V. Grasso, U. la Commare, and G. Perrone, “Evolutionary approach to multi-objective scheduling of mixed model assembly lines,” Computers and Industrial Engineering, vol. 37, no. 1, pp. 69–73, 1999.
[22]  D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
[23]  L. Davis, Ed., Handbook of Genetic Algorithm, Van Nostrand Reinhold, New York, NY, USA, 1991.
[24]  C. R. Reeves, “A genetic algorithm for flowshop sequencing,” Computers and Operations Research, vol. 22, no. 1, pp. 5–13, 1995.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413