The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering

Abstract

The scheduling and rostering of personnel is a problem that occurs in many organizations. Aircrew scheduling has attracted considerable attention with many heuristic methods being proposed, but in recent times set partitioning optimization methods have become more popular. The aircrew rostering problem is discussed and formulated as a generalized set partitioning model. Because of the extremely large optimization models that are generated in practical situations, some special computational techniques have been developed to produce solutions efficiently. These techniques are used to solve problems arising from an airline application in which set partitioning models with more than 650 constraints and 200 000 binary variables are generated. The solutions are produced on a Motorola 68020 microprocessor in little more than three hours.

Cite this work

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

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

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