Multi Objective Simultaneous Assembly Line Balancing and Buffer Sizing

Authors: Saif Ullah, Guan Zailin, Xu Xianhao, He Zongdong, Wang Baoxi

Abstract:

Assembly line balancing problem is aimed to divide the tasks among the stations in assembly lines and optimize some objectives. In assembly lines the workload on stations is different from each other due to different tasks times and the difference in workloads between stations can cause blockage or starvation in some stations in assembly lines. Buffers are used to store the semi-finished parts between the stations and can help to smooth the assembly production. The assembly line balancing and buffer sizing problem can affect the throughput of the assembly lines. Assembly line balancing and buffer sizing problems have been studied separately in literature and due to their collective contribution in throughput rate of assembly lines, balancing and buffer sizing problem are desired to study simultaneously and therefore they are considered concurrently in current research. Current research is aimed to maximize throughput, minimize total size of buffers in assembly line and minimize workload variations in assembly line simultaneously. A multi objective optimization objective is designed which can give better Pareto solutions from the Pareto front and a simple example problem is solved for assembly line balancing and buffer sizing simultaneously. Current research is significant for assembly line balancing research and it can be significant to introduce optimization approaches which can optimize current multi objective problem in future.

Keywords: Assembly line balancing, Buffer sizing, Pareto solutions.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1099120

References:

[1] A. Shtub, E.M Dar-El, “A methodology for the selection of assembly systems,” International Journal of Production Research,vol. 27, pp. 175–186, 1989.
[2] D.D Spinellis, and C.T Papadopoulos, “Production line buffer allocation: Genetic algorithms versus simulated annealing,”In proc. Second international Aegan conference on the analysis and modelling of manufacturing systems, 1999,pp. 12–101.
[3] C. Becker, A. Scholl, “A survey on problems and methods in generalized assembly line balancing,” European Journal of Operational Research, vol. 168, pp. 694–715, 2006.
[4] S. Gershwin and J. Schor, “Efficient algorithms for buffer space allocation,” Annals of Operation Research, vol. 93, pp. 117-144, 2000.
[5] M. Chica, Ó.Cordón, S. Damas, “An advanced multiobjective genetic algorithm design for the time and space assembly line balancing problem,” Computers & Industrial Engineering, vol. 61, pp. 103–117, 2011.
[6] N. Hamta, S.M.T. FatemiGhomi, F. Jolai, M.A Shirazi, “A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect,” Int. J. Production Economics, vol. 141, pp. 99-111, 2013.
[7] S.G Ponnambalam, P. Aravindan, G. Mogileeswar Naidu, “A multiobjective genetic algorithm for solving assembly line balancing problem, “ International Journal of Advanced Manufacturing Technology, vol. 16, issue 5, pp. 341–352, 2000.
[8] Nai-Chieh Wei and I-Ming Chao, “A solution procedure for type Esimple assembly line balancing problem,” Computers & Industrial Engineering, vol. 61, pp. 824-830, 2011.
[9] P. R. Mcmullen and P. Tarasewich, “Multi-objective assembly line balancing via a modified ant colony optimization technique,” International Journal of production Research, vol. 44, pp. 27-42, 2006.
[10] A. Altiparmak, A. Bugak and B. Dengiz, “Optimization of buffer sizes in assembly systems using intelligent techniques,” In Proceedings of the 2002 Winter Simulation Conference, San Diego, USA December 2002, pp. 1157–1162.
[11] K. D’Souza and S. Khator, “System reconfiguration to avoid deadlocks in automated manufacturing systems,” Computers & Industrial Engineering, vol. 32, issue 2, pp. 445 – 465, 1997.
[12] M. Hamada, H. Martz, E. Berg and A. Koehler, “Optimizing the product-based avaibility of a buffered industrial process, “ Reliability Engineering and System Safety, vol. 91, pp. 1039 – 1048, 2006.
[13] Y.K Kim, T.J Kim and Y. Kim, Y, “Genetic algorithms for assembly line balancing with various objectives,” Computers & Industrial Engineering, vol. 30, issue,3, pp. 397–409, 1996.
[14] B. Malakooti, and A. Kumar, “A knowledge-based system for solving multi-objective assembly line balancing problems,” International Journal of Production Research, vol. 34, vol. 9, pp. 2533–2552, 1996.
[15] R. G. Askin and M. Zhou M, “A parallel station heuristic for the mixedmodel production line balancing problem,” International Journal of Production Research, vol. 35, pp. 3095–3105, 1997.
[16] H. Gokcen and E. Erel, “A goal programming approach to mixed-model assembly line balancing problem,” International Journal of Production Economics, vol. 48, pp. 177–185, 1997.
[17] C. Merengo, F. Nava & A. Pozetti, “Balancing and sequencing manual mixed model assembly lines,” International Journal of Production Research, vol. 37, pp. 2835–2860, 1999.
[18] R.S. Chen, Y.K Lu and S.C Yu, “A hybrid genetic algorithm approach on multi-objective of assembly planning problem,” Engineering Applications of Artificial Intelligence, vol. 15, issue 5, pp. 447–457, 2002.
[19] P.M Vilarinho & A.S Simaria, “A two-stage heuristic method for balancing mixed-model assembly lines with parallel workstations,” International Journal of Production Research, vol. 40, pp. 1405–1420, 2002.
[20] J. Bukchin& J. Rubinovitz, “A weighted approach for assembly line design with station paralleling and equipment selection,” IIE Transactions, vol. 35, pp. 73–85, 2003.
[21] R. Gamberini, A. Grassi and B. Rimini, “A new multi-objective heuristic algorithm for solving the stochastic assembly line re-balancing problem,” International Journal of Production Economics, vol. 102, issue 2, pp. 226–243, 2006.
[22] A. Baykasoglu, “Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems,” Journal of Intelligent Manufacturing, vol. 17, pp. 217–232, 2006.
[23] A.C Nearchou, “Multi-objective balancing of assembly lines by population heuristics,” International Journal of Production Research, vol. 46, issue, 8, pp. 2275–2297, 2008.
[24] R.K Hwang, H. Katayama & M. Gen, „U-shaped assembly line balancing problem with genetic algorithm,” International Journal of Production Research, vol. 46, issue, 16, pp. 4637–4649, 2008.
[25] A. Nourmohammadi and M. Zandieh, “Assembly line balancing by a new multi-objective differential evolution algorithm based on TOPSIS,” International Journal of Production Research, vol. 49, pp. 2833–2855, 2011.
[26] A. Dolgui, A. Eremeev, A. Kolokolov and V. Sigaev, “A Genetic Algorithm for Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines,” Journal of Mathematical Modelling and Algorithms, vol 1, pp. 89-104, 2002.
[27] Abdul-Kader, “Capacity improvement of an unreliable production line – an analytical approach,” Computers & Operations Research, vol. 33, pp. 1695-1712, 2006.
[28] H. Chehade, F. Yalaoui, L. Amodeo and P. De Guglielmo, “Optimisation multi-objectif pour le problème de dimensionnement de buffers,” Journal of Decision Systems, vol. 18, no. 2, pp. 257287, 2009.
[29] J.M.Alden, “Estimating performance of two workstations in series with downtime and unequal speeds,” Research Publication R&D-9434, General Motors R&D Center, Warren, Michigan,2002.
[30] E. Dennis, Blumenfeld and Jingshan Li, “An analytical formula for throughput of a production line with identical stations and random failures,” Mathematical Problems in Engineering, vol. 2005, issue 3, pp. 293-308,2005.
[31] N. Boysen, M. Fliedner, A.Scholl, “Assembly line balancing: Which model to use when?,” International Journal of Production Economics, vol. 111, pp. 509–528, 2008.
[32] K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, “A fast and elitist multi objective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, issue 2, pp. 182–97, 2002.
[33] E. Zitzler, M. Laumanns& L. Thiele, “SPEA2: Improving the performance of the strength Pareto evolutionary algorithm,” TIK-Report 103, May 2001.