Generating, scheduling and rostering of shift crew-duties: Applications at the Hong Kong International Airport

Abstract In the context of manpower planning, goal programming (GP) is extremely useful for generating shift duties of fixed length. A fixed-length duty consists of a fixed number of contiguous hours of work in a day, with a meal/rest break somewhere preferably around the middle of these working hours. It is such properties that enable the straightforward, yet flexible GP modeling. We propose GP models for an integrated problem of crew duties assignment, for baggage services section staff at the Hong Kong International Airport. The problem is solved via decomposition into its duties generating phase—a GP planner, followed by its GP scheduling and rostering phase. The results can be adopted as a good crew schedule in the sense that it is both feasible, satisfying various work conditions, and “optimal” in minimizing idle shifts.

[1]  Gang Yu,et al.  OPERATIONS RESEARCH IN THE AIRLINE INDUSTRY. , 1998 .

[2]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[3]  Nysret Musliu,et al.  Local search for shift design , 2004, Eur. J. Oper. Res..

[4]  M. C. So,et al.  Generation of fixed-length duties by GP formulation , 2003 .

[5]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[6]  Paolo Toth,et al.  Models and algorithms for a staff scheduling problem , 2003, Math. Program..

[7]  Nagraj Balakrishnan,et al.  A network model for the rotating workforce scheduling problem , 1990, Networks.

[8]  Paolo Toth,et al.  Primal-dual algrorithms for the assignment problem , 1987, Discret. Appl. Math..

[9]  Sydney C. K. Chu,et al.  Crew scheduling of light rail transit in Hong Kong: from modeling to implementation , 1998, Comput. Oper. Res..

[10]  L. Schrage.  Optimization Modeling With LINDO , 1997 .

[11]  Dirk C. Mattfeld,et al.  Memetic Algorithm timetabling for non-commercial sport leagues , 2004, Eur. J. Oper. Res..

[12]  H. D. Ratliff,et al.  Unnetworks, with Applications to Idle Time Scheduling , 1978 .

[13]  Martin Desrochers,et al.  CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[14]  J C Falkner,et al.  ASPECTS OF BUS CREW SCHEDULING USING A SET PARTITIONING MODEL. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING , 1988 .

[15]  Andrew J. Mason,et al.  Integrated Simulation, Heuristic and Optimisation Approaches to Staff Scheduling , 1998, Oper. Res..

[16]  Larry W. Jacobs,et al.  Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling , 2000 .

[17]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[18]  Mehrdad Tamiz.  Multi-Objective Programming and Goal Programming , 1996 .

[19]  Ioannis Patrikalakis,et al.  A New Decomposition Scheme of the Urban Public Transport Scheduling Problem , 1992 .

[20]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

[21]  J M Rousseau,et al.  HASTUS I: A MATHEMATICAL PROGRAMMING APPROACH TO THE BUS DRIVER SCHEDULING PROBLEM. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT , 1981 .

[22]  Roberto Tadei,et al.  A greedy-based neighborhood search approach to a nurse rostering problem , 2004, Eur. J. Oper. Res..

[23]  D. M. Ryan,et al.  Express: Set Partitioning for Bus Crew Scheduling in Christchurch , 1992 .

[24]  Panagiotis Miliotis,et al.  An automated university course timetabling system developed in a distributed environment: A case study , 2004, Eur. J. Oper. Res..

[25]  Giorgio Gallo,et al.  Network models for vehicle and crew scheduling , 1984 .

[26]  Michel Gamache,et al.  A METHOD FOR OPTIMALLY SOLVING THE ROSTERING PROBLEM , 1993 .

[27]  Sydney C. K. Chu,et al.  A goal programming model for crew duties generation , 2001 .

[28]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[29]  Efthymios Housos,et al.  Combined bus and driver scheduling , 2002, Comput. Oper. Res..

[30]  G. Mitra,et al.  Computer Scheduling of Public Transport , 1982 .

[31]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[32]  M. Segal,et al.  The Operator-Scheduling Problem: A Network-Flow Approach , 1974, Oper. Res..

[33]  Matteo Fischetti,et al.  Modeling and Solving the Crew Rostering Problem , 1998, Oper. Res..

[34]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[35]  Jacques Desrosiers,et al.  A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..

[36]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[37]  Sanja Petrovic,et al.  Timetabling and Rostering , 2004, European Journal of Operational Research.

[38]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[39]  Sydney C. K. Chu,et al.  Planning and Scheduling Staff Duties by Goal Programming , 2003 .

[40]  B Hagberg.  AN ASSIGNMENT APPROACH TO THE ROSTERING PROBLEM: AN APPLICATION TO TAXI VEHICLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .

[41]  Marino Widmer,et al.  A case study of single shift planning and scheduling under annualized hours: A simple three-step approach , 2004, Eur. J. Oper. Res..

[42]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .