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.
Algorithm for Crew-Scheduling Problem with Bin-Packing Features
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 2197 , 1 ; 80-88
01.01.2010
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Algorithm for Crew-Scheduling Problem with Bin-Packing Features
Online Contents | 2010
|Springer Verlag | 2015
|The crew timetabling problem: An extension of the crew scheduling problem
Springer Verlag | 2006
|The crew timetabling problem: An extension of the crew scheduling problem
British Library Conference Proceedings | 2006
|The Operational Airline Crew Scheduling Problem
British Library Online Contents | 1998
|