Author:
Ma Kangxin,Yang Changchun,Xu Haojie,Lv Hexin,Hong Feng
Abstract
AbstractEmployee scheduling aims to assign employees to shifts to satisfy daily workload and constraints. Some employee scheduling problems and their variants have been proven NP-hard, and a series of works have been done. However, the existing algorithms consider the fixed work time, which may cause plenty of overstaffing and understaffing phenomenons. Hence, this paper proposes a fast-flexible strategy based approach (FFS) to solve it. FFS introduces the idea of soft work time, which allows the work time of employees can be adjusted in a range. Based on this, we set the flextime strategy to decide the specific work time of each employee every day. Besides, FFS adopts a pairwise-allocated strategy and proficiency average matrix to boost its efficiency and effectiveness. Finally, the extensive experimental evaluation shows that FFS is more effective and efficient than the baselines for solving the employee scheduling problem considering soft work time.
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Rahimian, E., Akartunali, K. & Levine, J. A hybrid integer and constraint programming approach to solve nurse rostering problems. Comput. Oper. Res. 82, 83–94 (2017).
2. Li, N., Li, X. & Forero, P. Physician scheduling for outpatient department with nonhomogeneous patient arrival and priority queue. Flex. Serv. Manuf. J. 34, 1–37 (2021).
3. Cildoz, M., Mallor, F. & Mateo, P. M. A grasp-based algorithm for solving the emergency room physician scheduling problem. Appl. Soft Comput. 103, 107151 (2021).
4. Guerriero, F. & Guido, R. Modeling a flexible staff scheduling problem in the era of covid-19. Optim. Lett. 16, 1–21 (2021).
5. Olivares, M., Yung, D., Bucarey, V. & Christiansen, M. Labor planning and shift scheduling in retail stores using customer traffic data. Available at SSRN (2020).