#TITLE_ALTERNATIVE#

#TITLE_ALTERNATIVE#

Airline crew scheduling is performed in two steps : construction of a minimum pairing's set and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more sets of crew starting from homebase in the first fight until return to homebase in the las...

Full description

Saved in:
Bibliographic Details
Main Author: IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/13929
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:13929
spelling id-itb.:139292017-09-27T11:43:01Z#TITLE_ALTERNATIVE# IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/13929 Airline crew scheduling is performed in two steps : construction of a minimum pairing's set and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more sets of crew starting from homebase in the first fight until return to homebase in the last fight. The set of pairing must be determined before finding the minimum set of pairing. In this final project, the algorithm for constructing the set of possible pairing in Elsa Pitriana's final project will be revisit. A new algorithm proposed, in which its first step is explore routes that are possible to be pairings. A pairing will be constructed by testing a route will satisfy crew's work rules or not. Using this algoritm, the set of pairing can be constructed efficiently. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description Airline crew scheduling is performed in two steps : construction of a minimum pairing's set and crew rostering problem. Pairing is a work schedule, consisting of a series of fights operated by one or more sets of crew starting from homebase in the first fight until return to homebase in the last fight. The set of pairing must be determined before finding the minimum set of pairing. In this final project, the algorithm for constructing the set of possible pairing in Elsa Pitriana's final project will be revisit. A new algorithm proposed, in which its first step is explore routes that are possible to be pairings. A pairing will be constructed by testing a route will satisfy crew's work rules or not. Using this algoritm, the set of pairing can be constructed efficiently.
format Final Project
author IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE
spellingShingle IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE
#TITLE_ALTERNATIVE#
author_facet IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE
author_sort IRAWATI (NIM 10107079); Pembimbing : Dr. Rieske Hadianti, ADE
title #TITLE_ALTERNATIVE#
title_short #TITLE_ALTERNATIVE#
title_full #TITLE_ALTERNATIVE#
title_fullStr #TITLE_ALTERNATIVE#
title_full_unstemmed #TITLE_ALTERNATIVE#
title_sort #title_alternative#
url https://digilib.itb.ac.id/gdl/view/13929
_version_ 1820736330326343680

Similar Items