Yayın:
AIRLINE CREW PAIRING PROBLEM: A LITERATURE REVIEW

dc.contributor.authorDeveci, Muhammet
dc.contributor.authorDemirel, Nihan Cetin
dc.date.accessioned2026-06-27T13:37:30Z
dc.date.issued2015
dc.description.abstractThe airline crew scheduling problem is one of the most important problems by all airline companies that can affect cost structure, time constraints etc. substantially. In terms of cost structure, crew costs come second in scale after fuel costs. The airline crew scheduling problem, therefore, is the key for developing solutions in order to decrease operational costs (total crew cost). Unlike the fuel expenses, operational costs can be controlled. The airline crew scheduling (ACS) is generally divided into crew pairing problem and crew rostering (or crew assignment) problem. Crew pairing and crew rostering are considered separate but related problems. The aim of the airline crew pairing problem (CPP) is to come up with a set of minimal cost crew pairings by covering all flight legs. In the rostering problem, these parings are assigned to specified crew members. In this paper, we review the literature on crew scheduling problems for airlines. Our aim is to present a comprehensive review, emphasizing recent studies and solution methodologies.en
dc.identifier.eissn1849-7535
dc.identifier.endpage111
dc.identifier.issn1849-6903
dc.identifier.startpage103
dc.identifier.urihttps://hdl.handle.net/20.500.14981/53864
dc.identifier.wos000447880200011
dc.language.isoeng
dc.publisherVARAZDIN DEVELOPMENT & ENTREPRENEURSHIP AGENCY
dc.relation.conference11th International Scientific Conference on Economic and Social Development (ESD) - Building Resilient Society
dc.relation.ispartofECONOMIC AND SOCIAL DEVELOPMENT (ESD)
dc.subjectAirline crew scheduling
dc.subjectCrew pairing
dc.subjectCrew rostering
dc.subjectSet partitioning
dc.subjectPublic Administration
dc.titleAIRLINE CREW PAIRING PROBLEM: A LITERATURE REVIEW
dc.typeProceedings Paper
dspace.entity.typePublication
local.import.sourceWOS

Dosyalar

Koleksiyonlar