Incorporating Maintenance Infeasibilities in an Aircraft Rotation Planning Model

Ram Gopalan ()
Additional contact information
Ram Gopalan: School of Business, Rutgers, The State University of New Jersey, 227, Penn Street, Camden, NJ 08102, USA

Asia-Pacific Journal of Operational Research (APJOR), 2021, vol. 38, issue 01, 1-27

Abstract: In any airline’s schedule development process, aircraft rotations must be planned for individual fleet types after fleet assignment. The aircraft rotation plans must conform to stringent maintenance requirements and this problem can be formulated as a periodic routing problem on an Eulerian graph. We analyze the computational complexity of developing maintenance rotations when some overnighting aircraft may not have sufficient time on the ground to complete extended maintenance (referred to as a maintenance infeasibility). The paper also provides a theoretical analysis of heuristics for the aircraft maintenance rotation problem with maintenance infeasibilities.

Keywords: Aircraft maintenance routing; complexity theory; heuristics (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595920500256
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:38:y:2021:i:01:n:s0217595920500256

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595920500256

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().