IDEAS home Printed from
   My bibliography  Save this article

Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions


  • Kozanidis, George


We develop an integer programming model and an exact solution methodology for assigning aircrew members to training sessions which they need to attend in order to fulfill the requirements for renewal of their flight capability. The aim is to find the optimal assignment that minimizes the number of unassigned trainees, while also satisfying a variety of seniority, preference, capacity and language compatibility restrictions. The proposed methodology partitions the aircrew members into distinct groups based on their seniority, making the optimal assignment decisions pertaining to each of these groups sequentially. We present extensive computational results demonstrating that the proposed methodology enables the solution of realistic size problems in moderate computational times.

Suggested Citation

  • Kozanidis, George, 2017. "Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions," Journal of Air Transport Management, Elsevier, vol. 59(C), pages 143-154.
  • Handle: RePEc:eee:jaitra:v:59:y:2017:i:c:p:143-154
    DOI: 10.1016/j.jairtraman.2016.11.012

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Haase, Knut & Latteier, Jorg & Schirmer, Andreas, 1998. "The course scheduling problem at Lufthansa Technical Training," European Journal of Operational Research, Elsevier, vol. 110(3), pages 441-456, November.
    2. Michel Gamache & François Soumis & Daniel Villeneuve & Jacques Desrosiers & Éric Gélinas, 1998. "The Preferential Bidding System at Air Canada," Transportation Science, INFORMS, vol. 32(3), pages 246-255, August.
    3. Xu, Jiefeng & Sohoni, Milind & McCleery, Mike & Bailey, T. Glenn, 2006. "A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems," European Journal of Operational Research, Elsevier, vol. 169(3), pages 978-993, March.
    4. Heykel Achour & Michel Gamache & François Soumis & Guy Desaulniers, 2007. "An Exact Solution Approach for the Preferential Bidding System Problem in the Airline Industry," Transportation Science, INFORMS, vol. 41(3), pages 354-365, August.
    5. Mehran Hojati, 2010. "Near-optimal solution to an employee assignment problem with seniority," Annals of Operations Research, Springer, vol. 181(1), pages 539-557, December.
    Full references (including those not matched with items on IDEAS)


    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:eee:jaitra:v:59:y:2017:i:c:p:143-154. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.