IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v62y2015i1p60-80.html
   My bibliography  Save this article

Maintenance and flight scheduling of low observable aircraft

Author

Listed:
  • Philip Cho
  • Vivek Farias
  • John Kessler
  • Retsef Levi
  • Thomas Magnanti
  • Eric Zarybnisky

Abstract

In this article, we focus on relatively new maintenance and operational scheduling challenges that are faced by the United States Air Force concerning low‐observable (LO) or stealth aircraft. The LO capabilities of an aircraft degrade stochastically as it flies, making it difficult to make maintenance scheduling decisions. Maintainers can address these damages, but must decide, which aircraft should be put into maintenance, and for how long. Using data obtained from an active duty Air Force F‐22 wing and interviews with Air Force maintainers and program specialists, we model this problem as a generalization of the well‐known restless multiarmed bandit superprocess. Specifically, we use an extension of the traditional model to allow for actions that require varying lengths of time, and generate two separate index policies from a single model; one for maintenance actions and one for the flying action. These index policies allow maintenance schedulers to intuitively, quickly, and effectively rank a fleet of aircraft based on each aircraft's LO status and decide, which aircraft should enter into LO maintenance and for how long, and which aircraft should be used to satisfy daily sortie requirements. Finally, we present extensive data‐driven, detailed simulation results, where we compare the performance of the index policies against policies currently used by the Air Force, as well as some other possible more naive heuristics. The results indicate that the index policies significantly outperform existing policies in terms of fully mission capable (FMC) rates. In particular, the experiments highlight the importance of coordinated maintenance and flying decisions. © 2015 Wiley Periodicals, Inc. 62:60–80, 2015

Suggested Citation

  • Philip Cho & Vivek Farias & John Kessler & Retsef Levi & Thomas Magnanti & Eric Zarybnisky, 2015. "Maintenance and flight scheduling of low observable aircraft," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(1), pages 60-80, February.
    • Handle: RePEc:wly:navres:v:62:y:2015:i:1:p:60-80
    DOI: 10.1002/nav.21614
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21614
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21614?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Glazebrook, K. D. & Mitchell, H. M. & Ansell, P. S., 2005. "Index policies for the maintenance of a collection of machines by a set of repairmen," European Journal of Operational Research, Elsevier, vol. 165(1), pages 267-284, August.
    2. Christos H. Papadimitriou & John N. Tsitsiklis, 1999. "The Complexity of Optimal Queuing Network Control," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 293-305, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Philip Cho & Aihua Wood & Krishnamurthy Mahalingam & Kurt Eyink, 2021. "Defect Detection in Atomic Resolution Transmission Electron Microscopy Images Using Machine Learning," Mathematics, MDPI, vol. 9(11), pages 1-16, May.
    2. Abderrahmane Abbou & Viliam Makis, 2019. "Group Maintenance: A Restless Bandits Approach," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 719-731, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Urtzi Ayesta & Manu K. Gupta & Ina Maria Verloop, 2021. "On the computation of Whittle’s index for Markovian restless bandits," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 179-208, February.
    2. Turgay Ayer & Can Zhang & Anthony Bonifonte & Anne C. Spaulding & Jagpreet Chhatwal, 2019. "Prioritizing Hepatitis C Treatment in U.S. Prisons," Operations Research, INFORMS, vol. 67(3), pages 853-873, May.
    3. Dong Li & Li Ding & Stephen Connor, 2020. "When to Switch? Index Policies for Resource Scheduling in Emergency Response," Production and Operations Management, Production and Operations Management Society, vol. 29(2), pages 241-262, February.
    4. T. W. Archibald & D. P. Black & K. D. Glazebrook, 2009. "Indexability and Index Heuristics for a Simple Class of Inventory Routing Problems," Operations Research, INFORMS, vol. 57(2), pages 314-326, April.
    5. Ece Zeliha Demirci & Joachim Arts & Geert-Jan Van Houtum, 2022. "A restless bandit approach for capacitated condition based maintenance scheduling," DEM Discussion Paper Series 22-01, Department of Economics at the University of Luxembourg.
    6. K. D. Glazebrook & C. Kirkbride & J. Ouenniche, 2009. "Index Policies for the Admission Control and Routing of Impatient Customers to Heterogeneous Service Stations," Operations Research, INFORMS, vol. 57(4), pages 975-989, August.
    7. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    8. Andrei Sleptchenko & M. Eric Johnson, 2015. "Maintaining Secure and Reliable Distributed Control Systems," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 103-117, February.
    9. José Niño-Mora, 2020. "Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays," Mathematics, MDPI, vol. 9(1), pages 1-36, December.
    10. José Niño-Mora, 2020. "A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 465-496, May.
    11. Can Urgun, 2021. "Restless Contracting," Working Papers 2021-88, Princeton University. Economics Department..
    12. Song Lin & Juanjuan Zhang & John R. Hauser, 2015. "Learning from Experience, Simply," Marketing Science, INFORMS, vol. 34(1), pages 1-19, January.
    13. Glazebrook, K. D. & Mitchell, H. M. & Ansell, P. S., 2005. "Index policies for the maintenance of a collection of machines by a set of repairmen," European Journal of Operational Research, Elsevier, vol. 165(1), pages 267-284, August.
    14. Vivek S. Borkar & Sarath Pattathil, 2022. "Whittle indexability in egalitarian processor sharing systems," Annals of Operations Research, Springer, vol. 317(2), pages 417-437, October.
    15. Urtzi Ayesta & M Erausquin & E Ferreira & P Jacko, 2016. "Optimal Dynamic Resource Allocation to Prevent Defaults," Working Papers hal-01300681, HAL.
    16. Ya‐Tang Chuang & Manaf Zargoush & Somayeh Ghazalbash & Saied Samiedaluie & Kerry Kuluski & Sara Guilcher, 2023. "From prediction to decision: Optimizing long‐term care placements among older delayed discharge patients," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1041-1058, April.
    17. S. Duran & U. Ayesta & I. M. Verloop, 2022. "On the Whittle index of Markov modulated restless bandits," Queueing Systems: Theory and Applications, Springer, vol. 102(3), pages 373-430, December.
    18. Vishal Ahuja & John R. Birge, 2020. "An Approximation Approach for Response-Adaptive Clinical Trial Design," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 877-894, October.
    19. K. D. Glazebrook & R. Minty, 2009. "A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 26-44, February.
    20. José Niño-Mora, 2023. "Markovian Restless Bandits and Index Policies: A Review," Mathematics, MDPI, vol. 11(7), pages 1-27, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:62:y:2015:i:1:p:60-80. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.