A constructive heuristic for staff scheduling in the Glass industry. (English) Zbl 1303.90051
Summary: In this paper a constructive heuristic for solving the staff scheduling problem of a glass manufacture unit is proposed. Based on simple calculations and algorithms, the developed procedure assigns working shifts and days-off to teams of employees, ensuring the satisfaction of a mandatory sequence of working shifts and the balance of the workload between employees. The computational times for the experiments with the case study company, with three eight-hour working shifts and five teams of employees, fell consistently below 5 seconds for a set of different planning periods. Results are compared with the ones achieved with an optimization model (MIP), demonstrating the good performance of the heuristic, also in terms of the quality of the achieved solutions. The heuristic rarely fails to produce a feasible solution and whenever the solution is feasible then it is also optimal. When tackling problems with a large number of teams, the heuristic maintains the good performance while the MIP model is not able to find any solution within 16 hours of running time. Although it was designed for a particular problem of the glass industry, tests show that the heuristic is flexible enough to be applied to problems with different features, from other activity sectors, encouraging further extensions of this work.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
| 90C59 | Approximation methods and heuristics in mathematical programming |
References:
| [1] | Abdennadher, S., & Schlenker, H. (1999). Nurse scheduling using constraint logic programming. In Proceedings of the 11th annual conference on innovative applications of artificial intelligence; IAAI-99 (pp. 838–843). |
| [2] | Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128(1–4), 159–177. · Zbl 1056.90049 · doi:10.1023/B:ANOR.0000019103.31340.a6 |
| [3] | Alfares, H. (2004). Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research, 127(1), 145–175. · Zbl 1087.90023 · doi:10.1023/B:ANOR.0000019088.98647.e2 |
| [4] | Baker, K. R. (1976). Workforce allocation in cyclical scheduling problems: a survey. Operational Research Quarterly, 27(1), 155–167. · doi:10.1057/jors.1976.30 |
| [5] | Balakrishnan, N., & Wong, R. T. (1990). A network model for the rotating workforce scheduling problem. Networks, 20, 25–42. · doi:10.1002/net.3230200103 |
| [6] | Bard, J. F., Binici, C., & DeSilva, A. H. (2003). Staff scheduling at the United States postal service. Computers & Operations Research, 30(5), 745–771. · Zbl 1026.90038 · doi:10.1016/S0305-0548(02)00048-5 |
| [7] | Bechtold, S., & Jacobs, L. (1990). Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science, 36(11), 1339–1351. · doi:10.1287/mnsc.36.11.1339 |
| [8] | Bhulai, S., Koole, G., & Pot, A. (2008). Simple methods for shift scheduling in multiskill call centers. Manufacturing & Service Operations Management, 10(3), 411–420. · doi:10.1287/msom.1070.0172 |
| [9] | Brusco, M., & Johns, T. (1996). A sequential integer programming method for discontinuous labor tour scheduling. European Journal of Operational Research, 95(3), 537–548. · Zbl 0926.90041 · doi:10.1016/S0377-2217(97)81461-0 |
| [10] | Burke, E., Causmaecker, P. D., & Berghe, G. V. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In B. McKay et al. (Eds.), Lecture notes in artificial intelligence (Vol. 1585, pp. 187–194). Berlin: Springer. |
| [11] | Burke, E., Cowling, P., De Causmaecker, P., & Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15(3), 199–214. · Zbl 0993.90506 · doi:10.1023/A:1011291030731 |
| [12] | Burke, E. K., De Causmaecker, P., Berghe, G. V., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441–499. · Zbl 1154.90422 · doi:10.1023/B:JOSH.0000046076.75950.0b |
| [13] | Burke, E. K., Li, J., & Qu, R. (2010). A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research, 203(2), 484–493. · Zbl 1177.90356 · doi:10.1016/j.ejor.2009.07.036 |
| [14] | Carrasco, R. C. (2010). Long-term staff scheduling with regular temporal distribution. Computer Methods and Programs in Biomedicine, 100(2), 191–199. · doi:10.1016/j.cmpb.2010.03.015 |
| [15] | Eitzen, G., Panton, D., & Mills, G. (2004). Multi-skilled workforce optimisation. Annals of Operations Research, 127(1–4), 359–372. · Zbl 1090.90077 · doi:10.1023/B:ANOR.0000019096.58882.54 |
| [16] | Enz, C. A. (2009). Key issues of concern in the lodging industry: what worries managers. Cornell Hospitality Report 4, The Center for Hospitality Research, School of Hotel Administration, Cornell University. |
| [17] | Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153(1), 3–27. · Zbl 1053.90034 · doi:10.1016/S0377-2217(03)00095-X |
| [18] | Gans, N., Koole, G., & Mandelbaum, A. (2003). Telephone call centers: tutorial, review, and research prospects. Manufacturing & Service Operations Management, 5(2), 79–141. · doi:10.1287/msom.5.2.79.16071 |
| [19] | Glass, C. A., & Knight, R. A. (2010). The nurse rostering problem: a critical appraisal of the problem structure. European Journal of Operational Research, 202(2), 379–389. · Zbl 1175.90272 · doi:10.1016/j.ejor.2009.05.046 |
| [20] | Laporte, G. (1999). The art and science of designing rotating schedules. Journal of the Operational Research Society, 50(10), 1011–1017. · Zbl 1054.90585 · doi:10.1057/palgrave.jors.2600803 |
| [21] | Laporte, G., & Pesant, G. (2004). A general multi-shift scheduling system. Journal of the Operational Research Society, 55(11), 1208–1217. · Zbl 1070.90056 · doi:10.1057/palgrave.jors.2601789 |
| [22] | Loucks, J., & Jacobs, F. (1991). Tour scheduling and task assignment of a heterogeneous work force: a heuristic approach. Decision Sciences, 22(4), 719–738. · doi:10.1111/j.1540-5915.1991.tb00361.x |
| [23] | Morris, J. G., & Showalter, M. J. (1983). Simple approaches to shift, days-off and tour scheduling problems. Management Science, 29(8), 942–950. · doi:10.1287/mnsc.29.8.942 |
| [24] | Morz, M., & Musliu, N. (2004). Genetic algorithm for rotating workforce scheduling problem. In Second IEEE international conference on computational cybernetics, 2004. ICCC 2004 (pp. 121–126). New York: IEEE Press. |
| [25] | Moz, M., & Pato, M. V. (2004). Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models. Annals of Operations Research, 128, 179–197. · Zbl 1056.90072 · doi:10.1023/B:ANOR.0000019104.39239.ed |
| [26] | Musliu, N. (2006). Heuristic methods for automatic rotating workforce scheduling. International Journal of Computational Intelligence Research, 2(4), 309–326. · doi:10.5019/j.ijcir.2006.69 |
| [27] | Ni, H., & Abeledo, H. (2007). A branch-and-price approach for large-scale employee tour scheduling problems. Annals of Operations Research, 155(1), 167–176. · Zbl 1145.90036 · doi:10.1007/s10479-007-0212-2 |
| [28] | Qu, R., & He, F. (2009). A hybrid constraint programming approach for nurse rostering problems. In T. Allen, R. Ellis, & M. Petridis (Eds.), Applications and innovations in intelligent systems XVI (pp. 211–224). 28th SGAI international conference on innovative techniques and applications of artificial intelligence. Cambridge, England. London: Springer. |
| [29] | Rekik, M., Cordeau, J. F., & Soumis, F. (2009). Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling, 13(1), 49–75. · Zbl 1185.90091 · doi:10.1007/s10951-009-0114-z |
| [30] | Rocha, M., Oliveira, J. F., & Carravilla, M. A. (2013). Cyclic staff scheduling: optimization models for some real-life problems. Journal of Scheduling, 16(2), 231–242. · doi:10.1007/s10951-012-0299-4 |
| [31] | Rong, A. (2010). Monthly tour scheduling models with mixed skills considering weekend off requirements. Computers & Industrial Engineering, 59(2), 334–343. · doi:10.1016/j.cie.2010.05.005 |
| [32] | Thompson, G. M., & Goodale, J. C. (2006). Variable employee productivity in workforce scheduling. European Journal of Operational Research, 170(2), 376–390. · Zbl 1085.90021 · doi:10.1016/j.ejor.2004.03.048 |
| [33] | Topaloglu, S., & Ozkarahan, I. (2004). An implicit goal programming model for the tour scheduling problem considering the employee work preferences. Annals of Operations Research, 128(1–4), 135–158. · Zbl 1056.90096 · doi:10.1023/B:ANOR.0000019102.68222.df |
| [34] | Totterdell, P. (2005). Work schedules. In J. Barling, E. Kelloway, & M. Frome (Eds.), Handbook of work stress (pp. 35–62). Thousand Oaks: SAGE, Chap. 3 |
| [35] | Ulusam Seçkiner, S., Gökçen, H., & Kurt, M. (2007). An integer programming model for hierarchical workforce scheduling problem. European Journal of Operational Research, 183(2), 694–699. · Zbl 1175.90191 · doi:10.1016/j.ejor.2006.10.030 |
| [36] | Valouxis, C., & Housos, E. (2000). Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine, 20(2), 155–175. · doi:10.1016/S0933-3657(00)00062-2 |
| [37] | Van den Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., & De Boeck, L. (2013). Personnel scheduling: a literature review. European Journal of Operational Research, 226(3), 367–385. · Zbl 1292.90001 · doi:10.1016/j.ejor.2012.11.029 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
