Author:
Kiermaier Ferdinand,Frey Markus,Bard Jonathan F.
Abstract
AbstractThe paper examines the complexity of assigning multiple breaks to shifts in the context of large-scale tour scheduling. A mixed-integer programming (MIP) model is presented that includes shift and days-off scheduling along with break assignments for a multi-skilled workforce. To achieve tractability, a two-stage decomposition procedure is proposed that separates the tour scheduling problem (TShP) from the break assignment problem (BAP). The former MIP is first solved to determine the shifts and days off for the workforce that minimize labor and shortages costs over the planning horizon. The results are used as input to a second MIP that optimally places the breaks to minimize the costs of working hours and uncovered periods. Three implicit BAP formulations are investigated. To better understand the literature and the models previously developed, a 3-field break classification scheme is introduced. The first field characterizes the number of breaks permitted per shift, the second specifies whether the length of the breaks is fixed or variable, and the third limits their position in a shift. A complexity analysis of the resulting 12 BAPs along with a few special cases is also included. Most problems are shown to be strongly NP-hard. Computations are presented for a wide variety of scenarios for both the TShP and the BAP using data provided by a European airport ground handler company. In all, over 500 instances were investigated using high and low demand fluctuation curves and the various break and shift flexibility options. The results indicate that increasing flexibility in break regulations can make a significant difference in coverage, but the degree depends on the underlying structure of the demand curve as well as on the types of shifts permitted. Formulations with the most flexible shift and break regulations reduced undercoverage by up to 16.68% compared to the most common scenarios in which shifts are limited to a single lunch break.
Funder
Technische Universität München
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference46 articles.
1. Addou, I., & Soumis, F. (2007). Bechtold-Jacobs generalized model for shift scheduling with extraordinary overlap. Annals of Operations Research, 155(1), 177–205.
2. Alfares, H. K. (2007). Operator staffing and scheduling for an IT-help call centre. European Journal of Industrial Engineering, 1(4), 414–430.
3. Ásgeirsson, E. I. (2012). Bridging the gap between self schedules and feasible schedules in staff scheduling. Annals of Operations Research, 218, 1–19.
4. Ashford, N., Stanton, H., & Moore, C. (1997). Airport operations. New York: McGraw Hill.
5. Avramidis, A. N., Chan, W., Gendreau, M., ECuyer, P., Pisacane, O., et al. (2010). Optimizing daily agent scheduling in a multiskill call center. European Journal of Operational Research, 200(3), 822–832.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献