Algorithm for Crew-Scheduling Problem with Bin-Packing Features

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.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01155514
  • Record Type: Publication
  • ISBN: 9780309160735
  • Report/Paper Numbers: 10-0642
  • Files: TRIS, TRB, ATRI
  • Created Date: Jan 25 2010 10:19AM