A Graph Partitioning Approach to Airline Crew Scheduling

Michael O. Ball · Anito Roberts

54 citations0/0 files storedTransportation Science

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Scheduling and Timetabling Solutions Air Traffic Management and Optimization Vehicle Routing Optimization Methods

Abstract

In this paper, we present a computerized procedure for scheduling airline crews. The procedure performs set partitioning on a graph by decomposing the problem into a series of subproblems which are solved as matching problems. Computational tests of the algorithm reveal consistent performance in producing efficient solutions to the air crew scheduling problem.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 54 citations exist upstream.

References

1969The Airline Crew Scheduling Problem: A Survey 1983A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles 1981Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications 1973A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling 1980A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem

Cited by

1999Best Practice Simulated Annealing for the Airline Crew Scheduling Problem 1998A fuzzy set theory approach to the aircrew rostering problem 2001A Bi-Criterion Approach for the Airlines Crew Rostering Problem 1998A dynamic programming based algorithm for the crew scheduling problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.