OPTIMAL LINKING OF TASKS AND SCHEDULE DEVELOPMENT FOR MILITARY AIR TRANSPORT
This paper considers the scheduling problem faced by a military air transport division when required to assign a set of tasks to a limited fleet of available aircraft. Each task is specified by a desired departure time and an allowable interval during which it can depart. The authors present a two-phase method for combining tasks into single flights, when optimal to do so, and then programming the resulting "tasks" (some of which are now combinations) on the aircraft. The linking/scheduling algorithm determines a schedule which minimizes total flying time, while giving attention to priority, customer satisfaction, and maintenance efficiency.
-
Corporate Authors:
Toronto University Press
Front Campus
Toronto, Ontario Canada M5S 1A6 -
Authors:
- Armstrong, R D
- Cook, W D
- Publication Date: 1976-2
Media Info
- Features: References;
- Pagination: p. 13-31
-
Serial:
- INFOR
- Volume: 14
- Issue Number: 1
- Publisher: Canadian Operational Research Society
Subject/Index Terms
- TRT Terms: Algorithms; Departure time; Flight time; Military aircraft; Scheduling; Strategic planning
- Subject Areas: Aviation; Economics;
Filing Info
- Accession Number: 00158231
- Record Type: Publication
- Source Agency: Engineering Index
- Files: TRIS
- Created Date: Aug 31 1977 12:00AM