Abstract
The Assembly Line Worker Assignment and Balancing Problem (ALWABP) appears in real assembly lines which we have to assign given tasks to workers where there are some task-worker incompatibilities and considering that the operation time for each task is different depending upon who executes the task. This problem is typical for Sheltered Work Centers for the Disabled and it is well known to be NP-Hard. In this paper, the hybrid method Clustering Search (CS) is implemented to solve the ALWABP. The CS identifies promising regions of the search space by generating solutions with a metaheuristic, such as Iterated Local Search, and clustering them into clusters that are then explored further with local search heuristics. Computational results considering instances available in the literature are presented to demonstrate the efficacy of the CS.
The authors acknowledge FAPESP (process 2008/09242-9) for the financial support given to the development of this work.
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
Preview
Unable to display preview. Download preview PDF.
References
Bellamy, G.T., Horner, R.H., Inman, D.P.: Vocational habilitation of severely retarded adults: a direct service technology. University press, Baltimore (1979)
Miralles, C., García-Sabater, J., Andrés, C., Cardós, M.: Advantages of assembly lines in sheltered work centres for disabled: a case study. International Journal of Production Economics 110(1-2), 187–197 (2007)
Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. In: Grosan, C., Abraham, A., Ishibuchi, H. (eds.) Hybrid Evolutionary Systems - Studies in Computational Intelligence, pp. 81–102. Springer, Heidelberg (2007)
Chaves, A.A., Lorena, L.A.N., Corrêa, F.A.: Clustering search heuristic for the capacitated p-median problem. Advances in Soft Computing 44, 136–143 (2008)
Lourenço, H., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 320–353. Springer, New York (2003)
Miralles, C., García-Sabater, J.P., Andrés, C., Cardós, M.: Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centres for disabled. Discrete Applied Mathematics 156(3), 352–367 (2008)
Chaves, A.A., Miralles, C., Lorena, L.A.N.: Clustering search approach for the assembly line worker assignment and balancing problem. In: Proceedings of 37th International Conference on Computers and Industrial Engineering, Alexandria, Egypt, pp. 1469–1478 (2007)
Chaves, A.A., Miralles, C., Lorena, L.A.N.: Uma meta-heurística híbrida aplicada ao problema de balanceamento e designação de trabalhadores em linha de produção. In: Proceedings of XL Simpósio Brasileiro de Pesquisa Operacional, João Pessoa, Brazil, pp. 143–152 (2008)
Kirkpatrick, S., Gellat, D.C., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Baybars, I.: A survey of exact algorithms for the simple assembly line balancing problem. Management Science 32, 909–932 (1986)
Pinnoi, A., Wilhelm, W.E.: A family of hierarchical models for assembly system design. International Journal of Production Research 35, 253–280 (1997)
Miralles, C., García-Sabater, J.P., Andrés, C.: Application of u-lines principles to the assembly line worker assignment and balancing problem: a model and a solving procedure. In: Proceedings of the Operational Research Peripatetic Postgraduate Programme International Conference (ORP3), Valencia, Spain (2005)
Costa, A.M., Miralles, C.: Job rotation in assembly lines employing disabled workers. International Journal of Production Economics (forthcoming)
Glover, F.: Tabu search and adaptive memory programing. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer, Dordrecht (1996)
Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)
Kilbridge, M., Wester, L.: The balance delay problem. Management Science 8(1), 69–84 (1961)
Scholl, A.: Data of assembly line balancing problems. University Press 16, TU Darmstadt (1993)
ILOG France: Ilog Cplex 10.0: user’s manual (2006)
Chaves, A.A., Lorena, L.A.N.: Hybrid metaheuristic for the prize collecting travelling salesman problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 123–134. Springer, Heidelberg (2007)
Filho, G.R., Nagano, M.S., Lorena, L.A.N.: Evolutionary clustering search for flowtime minimization in permutation flow shop. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 69–81. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaves, A.A., Lorena, L.A.N., Miralles, C. (2009). Hybrid Metaheuristic for the Assembly Line Worker Assignment and Balancing Problem. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-04918-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04917-0
Online ISBN: 978-3-642-04918-7
eBook Packages: Computer ScienceComputer Science (R0)