A Hybrid Personnel Scheduling Model for Staff Rostering Problems

被引:6
|
作者
Shiau, Jiun-Yan [1 ]
Huang, Ming-Kung [1 ]
Huang, Chu-Yi [1 ]
机构
[1] Natl Kaohsiung Univ Sci & Technol, Dept Logist Management, Kaohsiung 80778, Taiwan
关键词
personnel scheduling; staff rostering problem; mixed integer programming; aviation industry; CALL CENTERS; SERVICE; ALLOCATION; SHIFT;
D O I
10.3390/math8101702
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The problem of staff scheduling in the airline industry is extensively investigated in operational research studies because efficient staff employment can drastically reduce the operational costs of airline companies. Considering the flight schedule of an airline company, staff scheduling is the process of assigning all necessary staff members in such a way that the airline can operate all its flights and construct a roster line for each employee while minimizing the corresponding overall costs for the personnel. This research uses a rostering case study of the ground staff in the aviation industry as an example to illustrate the application of integrating monthly and daily schedules. The ground staff in the aviation industry case is a rostering problem that includes three different types of personnel scheduling results: fluctuation-centered, mobility-centered, and project-centered planning. This paper presents an integrated mixed integer programming (MIP) model for determining the manpower requirements and related personnel shift designs for the ground staff at the airline to minimize manpower costs. The aim of this study is to complete the planning of the monthly and daily schedules simultaneously. A case study based on real-life data shows that this model is useful for the manpower planning of ground services at the airline and that the integrated approach is superior to the traditional two-stage approach.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 50 条
  • [41] New Benchmark Instances for the Staff Rostering Problem
    Nurmi, Kimmo
    Kyngas, Jari
    Kyngas, Nico
    WORLD CONGRESS ON ENGINEERING, WCE 2015, VOL II, 2015, : 853 - 857
  • [42] Network flow models for intraday personnel scheduling problems
    Peter Brucker
    Rong Qu
    Annals of Operations Research, 2014, 218 : 107 - 114
  • [43] Network flow models for intraday personnel scheduling problems
    Brucker, Peter
    Qu, Rong
    ANNALS OF OPERATIONS RESEARCH, 2014, 218 (01) : 107 - 114
  • [44] On the complexity of Nurse Rostering problems
    den Hartog, Steven J. M.
    Hoogeveen, Han
    van der Zanden, Tom C.
    OPERATIONS RESEARCH LETTERS, 2023, 51 (05) : 483 - 487
  • [45] Rostering staff at a mathematics support service using a finite-source queueing model
    Gillard, Jonathan
    Knight, Vincent
    Vile, Julie
    Wilson, Robert
    IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2016, 27 (02) : 201 - 209
  • [46] Automating Personnel Rostering by Learning Constraints Using Tensors
    Kumar, Mohit
    Teso, Stefano
    De Causmaecker, Patrick
    De Raedt, Luc
    2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 697 - 704
  • [47] A categorisation of nurse rostering problems
    Patrick De Causmaecker
    Greet Vanden Berghe
    Journal of Scheduling, 2011, 14 : 3 - 16
  • [48] A categorisation of nurse rostering problems
    De Causmaecker, Patrick
    Berghe, Greet Vanden
    JOURNAL OF SCHEDULING, 2011, 14 (01) : 3 - 16
  • [49] Rostering with a hybrid Genetic Algorithm
    Gröbner, M
    Wilke, P
    ARTIFICIAL NEURAL NETS AND GENETIC ALGORITHMS, 2001, : 316 - 319
  • [50] A stochastic programming model for scheduling maintenance personnel
    Duffuaa, SO
    Al-Sultan, KS
    APPLIED MATHEMATICAL MODELLING, 1999, 23 (05) : 385 - 397