Risk-averse assembly line worker assignment and balancing problem with limited temporary workers and moving workers
Ming Liu, Zhongzheng Liu, Feng Chu, Rongfan Liu, Feifeng Zheng, Chengbin Chu
Abstract
Assembly line worker assignment and balancing problem (ALWABP) is an important research topic originated from sheltered work centres for disabled, in which workforce is assumed to be heterogeneous due to their disabilities. Since the employment of disabled workers may sustain higher absenteeism rates due to their health, especially under COVID-19, employing temporary workers to fill labour shortage is a crucial issue. In addition, in practice, the movement of workers between stations on assemble lines can increase the flexibility of worker assignment. In this study, we investigate a new risk-averse ALWABP with uncertain disabled worker availability, limited temporary workers and moving workers. The objective is to minimise the risk-averse weighted sum of the cycle time and the number of employed temporary workers. For the problem, a risk-averse two-stage stochastic programming model is formulated. The first stage assigns specific tasks (called fixed tasks) to stations, while the second stage assigns workers and remaining tasks (called flexible tasks) to stations. A genetic algorithm combining K-means clustering approach and variable neighbourhood search (GAKV) is designed. Experiment results show the superiority of the GAKV in terms of solution quality and computation time compared with sample average approximation (SAA). In addition, managerial insights are drawn.