Algorithm for Crew-Scheduling Problem with Bin-Packing Features | Zendy

Wenxin Qiao | Zendy; Masoud Hamedi | Zendy; Ali Haghani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Algorithm for Crew-Scheduling Problem with Bin-Packing Features

Author(s) -

Wenxin Qiao,

Masoud Hamedi,

Ali Haghani

Publication year - 2010

Publication title -

transportation research record journal of the transportation research board

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.624

H-Index - 119

eISSN - 2169-4052

pISSN - 0361-1981

DOI - 10.3141/2197-10

Subject(s) - bin packing problem , crew scheduling , crew , scheduling (production processes) , mathematical optimization , computer science , bin , operations research , algorithm , engineering , mathematics , aeronautics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research