A three-phase approach to solving the bidline problem

A three-phase approach to solving the bidline problem

0.00 Avg rating0 Votes
Article ID: iaor20043487
Country: Netherlands
Volume: 127
Issue: 1
Start Page Number: 283
End Page Number: 308
Publication Date: Mar 2004
Journal: Annals of Operations Research
Authors: ,
Keywords: cutting stock, transportation: air, programming: integer, sets
Abstract:

This paper describes a three-phase approach to solving the bidline generation problem within airline flightcrew scheduling. Phase I builds “patterns” from existing pairings. Phase 2 builds bidlines from the “patterns” found in Phase I and solves a set partitioning problem to generate a final schedule. If Phase 2 fails to cover enough of the scheduled work, Phase 3 is used to fill in the uncovered pairings. Along with this methodology is a new rule set that tries to improve the work–rest schedule for flightcrews by trying to take into account circadian rhythms. This new rule set is an attempt at addressing some of the flightcrews quality of life issues.

Reviews

Required fields are marked *. Your email address will not be published.