Assembly Line Balancing Using Real Coded Genetic Algorithm
Keywords:
Component, Assembly Line Balancing, Real Coded Genetic Algorithm, Balance Delay, Precedence FoulingAbstract
Assembly line balancing is to assign the tasks to the workstations, so as to achieve the number of workstations and maximization of the production rate through reduction in balance delay. This paper represents the use of real coded genetic algorithm for assembly line balancing. An application example is presented and solved to illustrate the effectiveness of the presented algorithm. For the considered problem, tact time is fixed whereas the sequence of the work content can vary as per the precedence.
References
C. Becker and A. Scholl, "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, vol. 168, pp. 694-715, Feb 1 2006
S. O. Tasan & S. Tunali, "A review of the current applications of genetic algorithms in assembly line balancing," Journal of Intelligent Manufacturing, vol. 19, pp. 49-69, Feb 2008
Matthias Amen,”An exact method for cost oriented assembly line balancing”. International Journal of Production Economics, Vol. 64, pp.187-195,2000
Mingzhou Jina & S. David Wub, “A new heuristic method for mixed model assembly line balancing problem”. Computers & Industrial Engineering, Vol. 44, pp.159–169,2002
Krzysztof Fleszar & Khalil S. Hindi , “An enumerative heuristic and reduction methods for the assembly line balancing problem”. European Journal of Operational Research ,Vol. 145, pp. 606–620,2003
Selcuk Karabati & Serpil Sayin, “Assembly line balancing in a mixed-model sequencing environment with synchronous transfers”. European Journal of Operational Research, Vol. 149, pp.417–429, 2003
D.J. Fonseca, C.L. Guest, M. Elam & C.L. Karr “A Fuzzy Logic Approach to Assembly Line Balancing”. Mathware & Soft Computing, Vol.12, pp. 57-74,2005
Hadi Gokcen, Kursat Agpak, Cevriye Gencer & Emel Kizilkaya , “A shortest route formulation of simple U-type assembly line balancing problem”. Applied Mathematical Modelling ,Vol.29, pp.373–380,2005
Yossi Bukchin & Ithai Rabinowitch,“Production, manufacturing and Logistics A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs”. European Journal of Operational Research ,Vol.174, pp. 492–508,2006
Sophie D. Lapierre, Angel Ruiz & Patrick Soriano, “Balancing assembly lines with tabu search”. European Journal of Operational Research ,Vol.168,pp.826–837,2006
Kuan Eng Chong, Mohamed K. Omar & Nooh Abu Bakar, “Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics-Treated Initial Population”. World Congress on Engineering,Vol II,pp. 2-5,2008
Darrell Whitley, “ A genetic algorithm tutorial”, Statistics and computing,Vol.4,pp.65-85,1994
Edward J. Anderson & Michael C. Ferris, “A Genetic algorithm for the assembly line problem” , Computer Science Technical Report, 926,pp. 3-16,1990
Runwei Cheng, Mitsuo Gen t, Tatsumi Tosawa, “Genetic algorithm for designing loop layout manufacturing systems”, Computer Industrial Engineering, Vol 31,pp.587-591,1996
Alper Hamzadayi & Gokalp Yildiz, “A genetic algorithm based approach for simultaneously balancing and sequencing of mixed-model U-lines with parallel workstations and zoning constraints”. Computers & Industrial Engineering, Vol. 62, pp. 206-215,2012
Ana Sofia Simaria & Pedro M. Vilarinho (2004) “A genetic algorithm based approach to the mixedmodel assembly line balancing problem of type II”. Computers & Industrial Engineering, Vol. 47, pp.391–407,2004
Gregory Levitin, Jacob Rubinovitz & Boris Shnits, “A genetic algorithm for robotic assembly line balancing”. European Journal of Operational Research ,Vol.168, pp.811–825,2006
I. Sabuncuoglu, et al., "Assembly line balancing using genetic algorithms," Journal of Intelligent Manufacturing, vol. 11, pp. 295-310, May 2000
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
