IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v46y2016i4p326-333.html
   My bibliography  Save this article

From F-16 to F-35: Optimizing the Training of Pilots in the Royal Norwegian Air Force

Author

Listed:
  • Maria Fleischer Fauske

    (Norwegian Defence Research Establishment, 2027 Kjeller, Norway)

  • Erlend Øby Hoff

    (Norwegian Defence Research Establishment, 2027 Kjeller, Norway)

Abstract

The Norwegian Armed Forces will soon make the largest investment in its history. It plans to spend $8 billion to replace the Royal Norwegian Air Force’s existing fleet of F-16 aircraft with 52 new F-35 aircraft. The Norwegian Defence Research Establishment (FFI) has undertaken multiple analyses to support the Norwegian Defence Logistics Organisation (NDLO) with the transition planning. During the transition period, Norway must maintain adequate fighter capability. The rate at which it can train new pilots and convert F-16 pilots to fly the F-35 will influence the cost and length of the transition period and the Air Force’s operational-readiness status. Although finding the optimal training rate for pilots is a difficult planning problem, we achieved substantial success by using an integer linear program to generate optimal plans. By using this model, we were able to investigate multiple scenarios for pilot training. We determined the earliest year that the Air Force could reach a fully operational F-35 fighter capability, the optimal ratio of new to converted pilots, and the number of pilots that FFI should train each year during the transition phase. Our results enabled FFI to generate a training plan that resulted in large savings and operational advantages compared to the previous solution, which did not employ operations research techniques for planning.

Suggested Citation

  • Maria Fleischer Fauske & Erlend Øby Hoff, 2016. "From F-16 to F-35: Optimizing the Training of Pilots in the Royal Norwegian Air Force," Interfaces, INFORMS, vol. 46(4), pages 326-333, August.
    • Handle: RePEc:inm:orinte:v:46:y:2016:i:4:p:326-333
    DOI: 10.1287/inte.2016.0850
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.2016.0850
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2016.0850?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. Brucker, Peter & Qu, Rong & Burke, Edmund, 2011. "Personnel scheduling: Models and complexity," European Journal of Operational Research, Elsevier, vol. 210(3), pages 467-473, May.
    2. Betty W. Holz & James M. Wroth, 1980. "Improving Strength Forecasts: Support for Army Manpower Management," Interfaces, INFORMS, vol. 10(6), pages 37-52, December.
    3. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    Full references (including those not matched with items on IDEAS)

    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. Martin Branda & Štěpán Hájek, 2017. "Flow-based formulations for operational fixed interval scheduling problems with random delays," Computational Management Science, Springer, vol. 14(1), pages 161-177, January.
    2. Pahlevani, Delaram & Abbasi, Babak & Hearne, John W. & Eberhard, Andrew, 2022. "A cluster-based algorithm for home health care planning: A case study in Australia," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Caselli, Giulia & Delorme, Maxence & Iori, Manuel, 2022. "Integer linear programming for the Tutor Allocation Problem : A practical case in a British University," Other publications TiSEM 983593a6-c17d-4b87-8ee1-a, Tilburg University, School of Economics and Management.
    4. Semih Yalçındağ & Andrea Matta & Evren Şahin & J. George Shanthikumar, 2016. "The patient assignment problem in home health care: using a data-driven method to estimate the travel times of care givers," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 304-335, June.
    5. Young-Chae Hong & Amy Cohn & Stephen Gorga & Edmond O’Brien & William Pozehl & Jennifer Zank, 2019. "Using Optimization Techniques and Multidisciplinary Collaboration to Solve a Challenging Real-World Residency Scheduling Problem," Interfaces, INFORMS, vol. 49(3), pages 201-212, May.
    6. Smirnov, Dmitry & Huchzermeier, Arnd, 2020. "Analytics for labor planning in systems with load-dependent service times," European Journal of Operational Research, Elsevier, vol. 287(2), pages 668-681.
    7. Ladier, Anne-Laure & Alpan, Gülgün & Penz, Bernard, 2014. "Joint employee weekly timetabling and daily rostering: A decision-support tool for a logistics platform," European Journal of Operational Research, Elsevier, vol. 234(1), pages 278-291.
    8. Xiang Li & Haoyue Fan & Jiaming Liu & Qifeng Xun, 2022. "Staff scheduling in blood collection problems," Annals of Operations Research, Springer, vol. 316(1), pages 365-400, September.
    9. Zhang, Zizhen & Qin, Hu & Wang, Kai & He, Huang & Liu, Tian, 2017. "Manpower allocation and vehicle routing problem in non-emergency ambulance transfer service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 45-59.
    10. Annear, Luis Mauricio & Akhavan-Tabatabaei, Raha & Schmid, Verena, 2023. "Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1109-1125.
    11. da Cunha, Joaquim J. & de Souza, Mauricio C., 2018. "A linearized model for academic staff assignment in a Brazilian university focusing on performance gain in quality indicators," International Journal of Production Economics, Elsevier, vol. 197(C), pages 43-51.
    12. Marlin Ulmer & Martin Savelsbergh, 2020. "Workforce Scheduling in the Era of Crowdsourced Delivery," Transportation Science, INFORMS, vol. 54(4), pages 1113-1133, July.
    13. Neda Tanoumand & Tonguç Ünlüyurt, 2021. "An exact algorithm for the resource constrained home health care vehicle routing problem," Annals of Operations Research, Springer, vol. 304(1), pages 397-425, September.
    14. Guastaroba, G. & Côté, J.-F. & Coelho, L.C., 2021. "The Multi-Period Workforce Scheduling and Routing Problem," Omega, Elsevier, vol. 102(C).
    15. Parisio, Alessandra & Neil Jones, Colin, 2015. "A two-stage stochastic programming approach to employee scheduling in retail outlets with uncertain demand," Omega, Elsevier, vol. 53(C), pages 97-103.
    16. R. K. Jha & B. S. Sahay & P. Charan, 2016. "Healthcare operations management: a structured literature review," DECISION: Official Journal of the Indian Institute of Management Calcutta, Springer;Indian Institute of Management Calcutta, vol. 43(3), pages 259-279, September.
    17. Mosquera, Federico & Smet, Pieter & Vanden Berghe, Greet, 2019. "Flexible home care scheduling," Omega, Elsevier, vol. 83(C), pages 80-95.
    18. Layin Wang & Dong Zhao & Yanqi Zhong, 2021. "Sustainable Allocation Model of Construction Workforce for Work Resumption during COVID-19," Sustainability, MDPI, vol. 13(11), pages 1-22, June.
    19. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    20. Tristan Becker, 2020. "A decomposition heuristic for rotational workforce scheduling," Journal of Scheduling, Springer, vol. 23(5), pages 539-554, October.

    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:inm:orinte:v:46:y:2016:i:4:p:326-333. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.