Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/19959
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMISHRA, JYOTI-
dc.contributor.authorKAUSHIK, UJJWAL-
dc.date.accessioned2023-07-11T05:39:22Z-
dc.date.available2023-07-11T05:39:22Z-
dc.date.issued2023-05-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/19959-
dc.description.abstractEfficient crew scheduling plays a vital role in ensuring smooth operations and optimal resource utilization within the airline industry. This report presents a comprehensive analysis of crew scheduling using the Hungarian method, a powerful technique derived from operations research. The objective of this study is to develop a systematic approach for assigning crew members to flights, considering various constraints such as crew availability, qualifications, and legal regulations. The report begins by providing an overview of the crew scheduling problem, emphasizing its complexity due to the large number of flights, crew members, and intricate interdependencies. It then introduces the Hungarian method as a suitable mathematical framework for optimizing crew assignments, leveraging its ability to solve assignment problems in polynomial time. Next, the report outlines the implementation of the Hungarian method in the context of crew scheduling. It explains the process of formulating the problem as an assignment matrix. To evaluate the performance of the Hungarian method, the report presents a case study involving a medium-sized airline. Real-world data, including flight schedules, crew availability, and legal regulations, are utilized to demonstrate the effectiveness of the proposed approach. The results show significant improvements in crew utilization and operational efficiency compared to traditional manual scheduling methods. In conclusion, the application of the Hungarian method in crew scheduling proves to be a valuable tool for airlines, enabling them to optimize crew assignments while considering multiple constraints.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD-6496;-
dc.subjectINTEGER PROGRAMMINGen_US
dc.subjectASSIGNMENT PROBLEMen_US
dc.subjectHUNGARIAN METHODen_US
dc.subjectCONSTRAINTSen_US
dc.subjectOPERATIONAL REQUIREMENTSen_US
dc.titleAIRLINE PLANNING AND SCHEDULINGen_US
dc.typeThesisen_US
Appears in Collections:M Sc Applied Maths

Files in This Item:
File Description SizeFormat 
JYOTI and Ujjwal M.Sc..pdf994.19 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.