An algorithm for crew scheduling problem with bin packing features

This thesis proposes a new approach for solving the traditional crew scheduling problem. The crew scheduling problem is solved with a bin packing approach in polynomial time. Based on the extensive research on the bin packing problem during the past 40 years, an algorithm that is proved 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 in this study. A case study is conducted using the proposed algorithm and the results are discussed.