Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/70385
Title: Penyelesaian Masalah Crew Pairing Maskapai Penerbangan dengan 0-1 Integer Programming
Authors: Supriyo, Prapto Tri
Silalahi, Paruhum
Dewi, Anne Yuliana Utami
Issue Date: 2014
Abstract: Crew pairing is a sequence of flights that begins from a crew base and ends at the same crew base that will be served by a member of crew. Determination of crew pairing is one part of the operational cost efficiency efforts on commercial airline. The purpose of this study is to minimize the number of crew pairing and the total waiting time between two flights (i.e., sit time). This problem is formulated as 0-1 Integer Programming. Implementation on the airline of Air Asia with 25 flights schedule within a period of one day provides 9 crew pairing with the total sit time 2075 minutes.
URI: http://repository.ipb.ac.id/handle/123456789/70385
Appears in Collections:UT - Mathematics

Files in This Item:
File Description SizeFormat 
G14ayu.pdf
  Restricted Access
full text831.91 kBAdobe PDFView/Open


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