#TITLE_ALTERNATIVE#

• Main Author: WIJAYANTI (NIM 10107074); Pembimbing : Dr. Rieske Hadianti, WIDYA
• Format: Final Project
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/14546
• Institution: Institut Teknologi Bandung

Crew scheduling problem is a difficult problem to solve since it involves a lot of data and crew's labor regulations. Crew scheduling problem usually performed in two steps: the construction of the minimum set of pairings and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more <br /> <br /> <br /> <br /> <br /> sets of crew starting from departure from homebase in the first fight until return to the homebase in the last fight. <br /> <br /> <br /> <br /> <br /> This final project discusses the first step of crew scheduling problem solving, the construction of the minimum set of pairings. The minimum set of pairings is the smallest subset of the set of possible pairings that must cover all the existing fight numbers with minimum cost and each fight number serviced by exactly one pairing. The optimization problem for the construction of the minimum set of pairings is a difficult problem to solve using exact methods when it involves large size set of possible pairings. <br /> <br /> <br /> <br /> <br /> This final project studies a heuristic method to solve the optimization problem for the construction of the minimum set of pairings. The heuristic method which is offered provides an optimal solution with a small number of iterations for some fight classes. At the end of this final project, it is discussed the improvement of heuristic algorithms for other fight classes.