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 条
  • [31] A polyhedral approach for the staff rostering problem
    Felici, G
    Gentile, C
    MANAGEMENT SCIENCE, 2004, 50 (03) : 381 - 393
  • [32] A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
    Burke, Edmund K.
    Li, Jingpeng
    Qu, Rong
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (02) : 484 - 493
  • [33] A hybrid integer and constraint programming approach to solve nurse rostering problems
    Rahimian, Erfan
    Akartunali, Kerem
    Levine, John
    COMPUTERS & OPERATIONS RESEARCH, 2017, 82 : 83 - 94
  • [34] Hybrid time slots sequencing model for a class of scheduling problems
    Castro, Pedro M.
    Zeballos, Luis J.
    Mendez, Carlos A.
    AICHE JOURNAL, 2012, 58 (03) : 789 - 800
  • [35] Modeling staff scheduling problems.: A tutorial
    Blöchliger, I
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (03) : 533 - 542
  • [36] Relaxation of coverage constraints in hospital personnel rostering
    De Causmaecker, P
    Vanden Berghe, G
    PRACTICE AND THEORY OF AUTOMATED TIMETABLING IV, 2003, 2740 : 129 - 147
  • [37] Personnel Rostering by Means of Variable Neighborhood Search
    Geiger, Martin Josef
    OPERATIONS RESEARCH PROCEEDINGS 2010, 2011, : 219 - 224
  • [38] Local and global constraint consistency in personnel rostering
    Smet, Pieter
    Salassa, Fabio
    Berghe, Greet Vanden
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (05) : 1099 - 1117
  • [39] A branch-and-price algorithm for integrating urban rail crew scheduling and rostering problems
    Feng, Tao
    Lusby, Richard M.
    Zhang, Yongxiang
    Tao, Siyu
    Zhang, Bojian
    Peng, Qiyuan
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2024, 183
  • [40] An Integrated Approach for Shift Scheduling and Rostering Problems with Break Times for Inbound Call Centers
    Turker, Turgay
    Demiriz, Ayhan
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2018, 2018