Show simple item record

dc.contributor.advisorR. Chairul Saleh
dc.contributor.authorNahtadia
dc.date.accessioned2021-02-25T09:00:11Z
dc.date.available2021-02-25T09:00:11Z
dc.date.issued2007
dc.identifier.urihttps://dspace.uii.ac.id/123456789/27307
dc.description.abstractThis research performed in an air transportation service company, PT. Merpati Nusantara Airlines. This research aims tofind the best flight schedule arrangement and to determine the minimum total of aircraft fleet size required to fulfill the schedule planned. In this research we willfind the optimum flight schedule for three airports, and finding how many aircrafts will be used to run the schedule. To solve such a fleet size problem, some mathematical models are needed Here, the mathematical model used is an algorithm for the minimum number of transport units to maintain a fixed schedule which is developed by T.E. Bartlett. By processing the data such as arrival and departure schedule we will find the minimum number of aircraft needed and the optimum flight schedule.en_US
dc.publisherUniversitas Islam Indonesiaen_US
dc.subjectFixed Scheduleen_US
dc.subjectFleet Size Problemen_US
dc.subjectAircraften_US
dc.titleOptimation Of Aircraft Fleet Size Based On Fixed Schedule Systemen_US
dc.Identifier.NIM03522161


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record