An Algorithm for Crew Scheduling Problem with Bin Packing Features

dc.contributor.advisor	Haghani, Ali	en_US
dc.contributor.author	Qiao, Wenxin	en_US
dc.contributor.department	Civil Engineering	en_US
dc.contributor.publisher	Digital Repository at the University of Maryland	en_US
dc.contributor.publisher	University of Maryland (College Park, Md.)	en_US
dc.date.accessioned	2009-01-24T07:07:58Z
dc.date.available	2009-01-24T07:07:58Z
dc.date.issued	2008-11-14	en_US
dc.description.abstract	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.	en_US
dc.format.extent	458238 bytes
dc.format.mimetype	application/pdf
dc.identifier.uri	http://hdl.handle.net/1903/8818
dc.language.iso	en_US
dc.subject.pqcontrolled	Transportation	en_US
dc.subject.pqcontrolled	Engineering, Civil	en_US
dc.subject.pqcontrolled	Engineering, Civil	en_US
dc.title	An Algorithm for Crew Scheduling Problem with Bin Packing Features	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1