Penyelesaian Masalah Crew Pairing Maskapai Penerbangan dengan 0-1 Integer Programming
dc.contributor.advisor | Supriyo, Prapto Tri | |
dc.contributor.advisor | Silalahi, Paruhum | |
dc.contributor.author | Dewi, Anne Yuliana Utami | |
dc.date.accessioned | 2014-11-25T07:28:22Z | |
dc.date.available | 2014-11-25T07:28:22Z | |
dc.date.issued | 2014 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/70385 | |
dc.description.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. | en |
dc.language.iso | id | |
dc.subject.ddc | Integers | en |
dc.subject.ddc | Mathematics and natural science | en |
dc.title | Penyelesaian Masalah Crew Pairing Maskapai Penerbangan dengan 0-1 Integer Programming | en |
dc.subject.keyword | crew pairing | en |
dc.subject.keyword | crew scheduling | en |
dc.subject.keyword | crew | en |
dc.subject.keyword | airline | en |
Files in this item
This item appears in the following Collection(s)
-
UT - Mathematics [1400]