Show simple item record

An Algorithm for Crew Scheduling Problem with Bin Packing Features

dc.contributor.advisorHaghani, Alien_US
dc.contributor.authorQiao, Wenxinen_US
dc.date.accessioned2009-01-24T07:07:58Z
dc.date.available2009-01-24T07:07:58Z
dc.date.issued2008-11-14en_US
dc.identifier.urihttp://hdl.handle.net/1903/8818
dc.description.abstractThis 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.extent458238 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleAn Algorithm for Crew Scheduling Problem with Bin Packing Featuresen_US
dc.typeThesisen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentCivil Engineeringen_US
dc.subject.pqcontrolledTransportationen_US
dc.subject.pqcontrolledEngineering, Civilen_US
dc.subject.pqcontrolledEngineering, Civilen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record