The traditional crew-scheduling problem is solved with a new bin-packing approach in polynomial time. On the basis of extensive research from the past 40 years, an algorithm that has been proven to be the most efficient for solving most bin-packing problems is selected and modified for application in the crew-scheduling problem. A modified best-fit-decreasing algorithm is proposed and discussed. A case study is conducted with the proposed algorithm and the results are discussed.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Algorithm for Crew-Scheduling Problem with Bin-Packing Features


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2010-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Crew Scheduling Problem

    Vaidyanathan, Balachandran / Ahuja, Ravindra K. | Springer Verlag | 2015


    The crew timetabling problem: An extension of the crew scheduling problem

    Gomes, Marta Castilho / Cavique, Luís / Themido, Isabel | Springer Verlag | 2006


    The crew timetabling problem: An extension of the crew scheduling problem

    Gomes, M. C. / Cavique, L. s. / Themido, I. | British Library Conference Proceedings | 2006


    The Operational Airline Crew Scheduling Problem

    Stojkovic, M. / Soumis, F. / Desrosiers, J. | British Library Online Contents | 1998