Optimizing the assignment of aircrews to aircraft in an airlift operation

The problems of constructing flight crew schedules, in the military as well as in the civilian arena, are usually so complex that efficient heuristics rather than optimal solutions are sought. For a special case of an airlift operation, this paper provides a simple exact algorithm to determine the m...

Full description

Saved in:
Bibliographic Details
Published inEuropean journal of operational research Vol. 77; no. 3; pp. 475 - 485
Main Authors Kress, M., Golany, B.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 29.09.1994
Elsevier
Elsevier Sequoia S.A
SeriesEuropean Journal of Operational Research
Subjects
Aircrew scheduling
Airlift operations
Applied sciences
Armed forces
Exact sciences and technology
Heuristic
Mathematical models
Military operations research
Military problems
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Aircrew scheduling
Airlift operations
Military operations research
Crew
Scheduling
Algorithm
Aircraft
Military problem
Network
Online AccessGet full text
ISSN0377-2217
1872-6860
DOI10.1016/0377-2217(94)90411-1

Cover

More Information
Summary:The problems of constructing flight crew schedules, in the military as well as in the civilian arena, are usually so complex that efficient heuristics rather than optimal solutions are sought. For a special case of an airlift operation, this paper provides a simple exact algorithm to determine the minimal number of crews required to be stationed at the various bases where the operation takes place. The paper also indicates, and illustrates via a simple example, how this algorithm can serve as the basis for some heuristics which will address the more complex crew scheduling problems.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)90411-1