Abstract
This paper deals with the assembly line balancing issue. The considered objective is to minimize the weighted sum of products’ cycle times. The originality of this objective is that it is the generalization of the cycle time minimization used in single-model lines (SALBP) to the multi-model case (MALBP). An optimization algorithm made of a heuristic and a tabu-search method is presented and evaluated through an experimental study carried out on several and various randomly generated instances for both the single and multi-product cases. The returned solutions are compared to optimal solutions given by a mathematical model from the literature and to a proposed lower bound inspired from the classical SALBP bound. The results show that the algorithm is high performing as the average relative gap between them is quite low for both problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akpinar, S., Bayhan, G.M., Baykasoglu, A.: Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks. Appl. Soft Comput. 13, 574–589 (2013)
Alavidoost, M.H., Zarandi, M.H.F., Tarimoradi, M., Nemati, Y.: Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times. J. Intell. Manuf. 28(2), 313–336 (2014). https://doi.org/10.1007/s10845-014-0978-4
Arikan, M.: Type-2 assembly line balancing with workload smoothing objective: a reactive tabu search algorithm. Gazi University Journal of Science 34(1), 162–178 (2021)
Baykasoglu, A.: Multi-rule multi-objective simulated annealing algorithm for straight and U type assembly line balancing problems. J. Intell. Manuf. 17, 217–232 (2006)
Chong, K.E., Omar, M.K., Baker, N.A.: Solving assembly line balancing problem using genetic algorithm with heuristic treated initial population. In: Proceedings of the World Congress on Engineering, pp. 978–988 (2008)
Çil, Z.A., Li, Z., Mete, S., Özceylan, E.: Mathematical model and bee algorithms for mixed-model assembly line balancing problem with physical human-robot collaboration
Chutima, P., Olanviwatchai, P.: Mixed-Model U-shaped assembly line balancing problems with coincidence memetic algorithm. J. Softw. Eng. Appl. 03(04), 347–363 (2010). https://doi.org/10.4236/jsea.2010.34040
Fatini, D.M., Mohammad, F.R., Mohd, Z.Z.: A review on hybrid metaheuristics in solving assembly line balancing problem. AIP Conf. Proc. 2138(1) (2019)
Gokcen, H., Erel, E.: Binary integer formulation for mixed model assembly line balancing problem. Comput. Ind. Eng. 34(2), 451–461 (1998)
Gutjahr, A.L., Nemhauser, G.L.: An algorithm for the line balancing problem. Manage. Sci. 11(2), 308–315 (1964)
Kilincci O.: A Petri net-based heuristic for simple assembly line balancing problem of type 2. Int. J. Adv. Manuf. Technol. 46, 329–338 (2010)
Klein, R., Scholl, A.: Maximizing the production rate in simple assembly line balancing—a branch and bound procedure. Eur. J. Oper. Res. 91(2), 367–385 (1996)
Lalaoui, M., El Afia, A.: A fuzzy generalized simulated annealing for a simple assembly line balancing problem. IFAC-PapersOnLine 51(32), 600–605 (2018)
Li, Z., Kucukkoc, I., Zhang, Z.: Branch, bound and remember algorithm for U-shaped assembly line balancing problem. Comput. Ind. Eng. 124, 24–35 (2018)
Roshani, A., Roshani, A., Roshani, A., Salehi, M., Esfandyari, A.: A simulated annealing algorithm for multi-manned assembly line balancing problem. J. Manuf. Syst. 32, 238–247 (2013)
Sarker, B.R., Pan, H.: Designing a mixed-model assembly line to minimize the costs of idle and utility times. Comput. Ind. Eng. 34(3), 609–628 (2001)
Scholl, A., Becker, C.: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur. J. Oper. Res. 168(3), 666–693 (2006)
Sivasankaran, P., Shahabudeen, P.: Literature review of assembly line balancing problems. Int. J. Adv. Manuf. Technol. 73(9–12), 1665–1694 (2014). https://doi.org/10.1007/s00170-014-5944-y
Suwannarongsri, S, Limnararat, S.: A hybrid tabu search method for assembly line balancing. In: Proceedings of the 7th International Conference on Simulation (modelling and optimization) China (2007)
Tseng, Y.J., Chen, J.Y., Huang, F.Y.: A multi-plant assembly sequence planning model with integrated assembly sequence planning and plant assignment using GA. Int. J. Adv. Manuf. Technol. 48, 333–345 (2010)
Yeh, D.H., Kao, H.H.: A new bidirectional heuristic for the assembly line balancing problem. Comput. Ind. Eng. 57, 1155–1160 (2009)
Zhang, W., Gen, M.: An efficient multi-objective genetic algorithm for mixed-model assembly line balancing problem considering demand ratio-based cycle time. J. Intell. Manuf. 22, 367–378 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Abdeljaouad, M.A., Klement, N. (2021). Tabu Search Algorithm for Single and Multi-model Line Balancing Problems. In: Dolgui, A., Bernard, A., Lemoine, D., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems. APMS 2021. IFIP Advances in Information and Communication Technology, vol 630. Springer, Cham. https://doi.org/10.1007/978-3-030-85874-2_43
Download citation
DOI: https://doi.org/10.1007/978-3-030-85874-2_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85873-5
Online ISBN: 978-3-030-85874-2
eBook Packages: Computer ScienceComputer Science (R0)
