A multiple-rule based constructive randomized search algorithm for solving assembly line worker assignment and balancing problem
- 443 Downloads
This paper proposes a constructive heuristic approach for the assembly line worker assignment and balancing problem (ALWABP). ALWABP arises when the operation time for every task differs according to the worker who executes the task. Since the operation times of tasks vary due to the workers, the problem requires a simultaneous solution to the double assignment problem. Tasks must be assigned to workers and workers to stations, concurrently. This problem is especially proposed in sheltered work centers for the disabled. However, it is not only important for the assembly lines with the disabled, but also for manually operated assembly lines with high labor turnover. In this paper, a multiple-rule based constructive randomized search (MRBCRS) algorithm is proposed in order to solve the ALWABP. Thirty nine task priority rules and four worker priority rules are defined. Performance of the proposed MRBCRS is compared with the relevant literature on benchmark data. Experimental results show that the proposed MRBCRS is very effective for benchmark problems. The results show that the algorithm improves upon the best-performing methods from the literature in terms of solution quality and time.
KeywordsAssembly line balancing Worker assignment Heuristic approaches Variable task times Combinatorial optimization
- Akyol, S. D., & Bayhan, G. M. (2011). ‘A particle swarm optimization algorithm for maximizing production rate and workload smoothness. In Third World Congress on Nature and Biologically Inspired Computing (NaBIC), IEEE, October, Spain (pp. 44–49).Google Scholar
- Bansal, J. C., Singh, P. K., Saraswat, M., Verma, A., Jadon, S. S. & Abraham, A. (2011). ‘Inertia weight strategies in particle swarm optimization. In Third World Congress on Nature and Biologically Inspired Computing (NaBIC), IEEE, October, Spain (pp. 633–640).Google Scholar
- Chaves, A. A., Miralles, C., & Lorena, L. A. N. (2007). Clustering search approach for the assembly line worker assignment and balancing problem. In Proceedings of the 37th International Conference on Computers and Industrial Engineering (pp. 1469–1478).Google Scholar
- Guo, Z. X., Wong, W. K., Leung, S. Y. S., Fan, J. T., et al. (2008). A genetic-algorithm-based optimization model for solving the flexible assembly line balancing problem with work sharing and workstation revisiting. IEEE Transactions on Systems, Man and Cybernetics Part C—Applications and Reviews, 38(2), 218–228.CrossRefGoogle Scholar
- Guo, Z. X., Shi, L., Chen, L., & Liang, Y. (2015). A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing. In OMEGA. doi: 10.1016/j.omega.2015.10.012 (in press)
- Miralles, C., Garcia-Sabater, J. P., Andres, C., & Cardos, M. (2008). 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. doi: 10.1016/j.dam.2005.12.012.
- Moreira, M. C. O., & Costa, A. M. (2009). A minimalist yet efficient tabu search for balancing assembly lines with disabled workers. In Anais do XLI Simposio Brasileiro de Pesquisa Operacional, Porto Seguro, Brazil (pp. 660–671).Google Scholar
- Polat, O., Kalayci, C. B., Mutlu, O., & Gupta, S. M. (2015). A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study. International Journal of Production Research, 54(3), 722–741. doi: 10.1080/00207543.2015.1055344.CrossRefGoogle Scholar