Abstract
Abstract We use deficit functions (DFs) to decompose an aviation schedule of aircraft flights into a minimal number of periodic and balanced chains (flight sequences). Each chain visits periodically a set S of airports and is served by several cockpit crews circulating along the airports of this set. We introduce the notion of ”chunks” which are a sequence of flights serviced by a crew in one day according to contract regulations. These chunks are then used to provide crew schedules and rosters. The method provides a simplicity for the construction of aircraft schedules and crew pairings which is absent in other approaches to the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
