A column generation approach for the shift design and rostering problem in airport ground handling

M. Firat, Joost van Twist, C.A.J. Hurkens

Onderzoeksoutput: Bijdrage aan congresAbstractAcademic

Uittreksel

In this study we propose a Column Generation based solution method that simultaneously solves a shift design- and rostering problem. In our problem setting, we consider a heterogeneous workforce demand of ground handling staff that is derived from a flight schedule in a given planning horizon. The pricing problem amounts to finding a shift schedule of a worker that corresponds to a longest path problem in the corresponding graph. In our case, several labour rules should be respected in the worker schedules which brings extra complexity to the pricing problem. Besides worker availabilities, we also consider worker preferences while constructing schedules. The instances contain around 200 workers and span a one-month planning horizon. Two types of workers are considered: First, we have workers with a fixed target amount of working hours each month. Second, we consider flexible workers that have no required target of working hours, but have a preferred number of working hours that can change each month based on preference. Each worker, when on duty, can cover the demand of various workloads. Our solution approach produces timetables and employee schedules with the goal of minimizing all labour costs while satisfying the workload demand. We introduce heuristics that employ graph theory for the pricing problem. Our approach is successfully tested on real life data of a ground handling company in an airport situated in the Netherlands.
TaalEngels
StatusGepubliceerd - 8 jul 2018

Vingerafdruk

Airports
Personnel
Costs
Preferred numbers
Planning
Graph theory
Availability
Industry

Citeer dit

@conference{3904e44b4c1c4e108cec58ab208b6342,
title = "A column generation approach for the shift design and rostering problem in airport ground handling",
abstract = "In this study we propose a Column Generation based solution method that simultaneously solves a shift design- and rostering problem. In our problem setting, we consider a heterogeneous workforce demand of ground handling staff that is derived from a flight schedule in a given planning horizon. The pricing problem amounts to finding a shift schedule of a worker that corresponds to a longest path problem in the corresponding graph. In our case, several labour rules should be respected in the worker schedules which brings extra complexity to the pricing problem. Besides worker availabilities, we also consider worker preferences while constructing schedules. The instances contain around 200 workers and span a one-month planning horizon. Two types of workers are considered: First, we have workers with a fixed target amount of working hours each month. Second, we consider flexible workers that have no required target of working hours, but have a preferred number of working hours that can change each month based on preference. Each worker, when on duty, can cover the demand of various workloads. Our solution approach produces timetables and employee schedules with the goal of minimizing all labour costs while satisfying the workload demand. We introduce heuristics that employ graph theory for the pricing problem. Our approach is successfully tested on real life data of a ground handling company in an airport situated in the Netherlands.",
author = "M. Firat and {van Twist}, Joost and C.A.J. Hurkens",
year = "2018",
month = "7",
day = "8",
language = "English",

}

A column generation approach for the shift design and rostering problem in airport ground handling. / Firat, M.; van Twist, Joost; Hurkens, C.A.J.

2018.

Onderzoeksoutput: Bijdrage aan congresAbstractAcademic

TY - CONF

T1 - A column generation approach for the shift design and rostering problem in airport ground handling

AU - Firat,M.

AU - van Twist,Joost

AU - Hurkens,C.A.J.

PY - 2018/7/8

Y1 - 2018/7/8

N2 - In this study we propose a Column Generation based solution method that simultaneously solves a shift design- and rostering problem. In our problem setting, we consider a heterogeneous workforce demand of ground handling staff that is derived from a flight schedule in a given planning horizon. The pricing problem amounts to finding a shift schedule of a worker that corresponds to a longest path problem in the corresponding graph. In our case, several labour rules should be respected in the worker schedules which brings extra complexity to the pricing problem. Besides worker availabilities, we also consider worker preferences while constructing schedules. The instances contain around 200 workers and span a one-month planning horizon. Two types of workers are considered: First, we have workers with a fixed target amount of working hours each month. Second, we consider flexible workers that have no required target of working hours, but have a preferred number of working hours that can change each month based on preference. Each worker, when on duty, can cover the demand of various workloads. Our solution approach produces timetables and employee schedules with the goal of minimizing all labour costs while satisfying the workload demand. We introduce heuristics that employ graph theory for the pricing problem. Our approach is successfully tested on real life data of a ground handling company in an airport situated in the Netherlands.

AB - In this study we propose a Column Generation based solution method that simultaneously solves a shift design- and rostering problem. In our problem setting, we consider a heterogeneous workforce demand of ground handling staff that is derived from a flight schedule in a given planning horizon. The pricing problem amounts to finding a shift schedule of a worker that corresponds to a longest path problem in the corresponding graph. In our case, several labour rules should be respected in the worker schedules which brings extra complexity to the pricing problem. Besides worker availabilities, we also consider worker preferences while constructing schedules. The instances contain around 200 workers and span a one-month planning horizon. Two types of workers are considered: First, we have workers with a fixed target amount of working hours each month. Second, we consider flexible workers that have no required target of working hours, but have a preferred number of working hours that can change each month based on preference. Each worker, when on duty, can cover the demand of various workloads. Our solution approach produces timetables and employee schedules with the goal of minimizing all labour costs while satisfying the workload demand. We introduce heuristics that employ graph theory for the pricing problem. Our approach is successfully tested on real life data of a ground handling company in an airport situated in the Netherlands.

M3 - Abstract

ER -