000			03332nas|a2200385 i 4500
005			20260817162040.0
008			121095s1982 th uu m rtt 00| a1eng d
035			_a.b10064904
099		9	_aAIT SSPR no. IE-82-09
100	1		_aSharma, Vijaya Raj
245	1	0	_aAircraft scheduling for the domestic network of the Royal Nepal Airlines Corporation
260			_aBangkok : _bAsian Institute of Technology, _c1982
300			_a1 v. (various pagings)
490	1		_aSpecial studies project report ; _vno. IE-82-09
500			_aA special study submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology
502			_aSpecial Studies Project Report (M. Eng.) - Asian Institute of Technology, 1982
520			_aRoyal Nepal Airlines Corporation (RNAC) is a government airliner entrusted with monopoly of operating domestic schedule services within Nepal. With its limited fleet of six Twin otters and three Avros, it is obliged to meet services in fortynine routes in the Kingdom. The operations of the airline are centralized requiring all the crafts to originate their last flight of the day there. Besides, some routes are restrained in flight time by weather considerations and there are only six routes where it has a choice of which type of craft to fly. In this context, the scheduling practice in RNAC has been a manual trial and error procedure to arrive at feasible schedules for the crafts. This study simplifies the task of scheduling and at the same time optimizes the cost of operating schedule services. The scheduling problem can be formulated as an integer programming model theoretically but because of its sheer size it cannot be solved in practice. The problem is thereby decomposed and solved in stages. First, weekly frequency of flights by each type of craft is determined in each route optimizing the cost of services using an integer programming model. later depending upon the frequency a combination of feasible schedules are derived for each craft. The study uses altogether two integer programming formulations solved by MPSX-MIP 370 IBM package and three other special purpose algorithms programmed in Fortran IV language. The task of the scheduler is to integrate the various stages of the method suggested in this study.
650		0	_aScheduling (Management)
700	1		_aOudheusden, Dirk L. Van, _eChairperson
700	1		_aTang, John C.S., _eExamination Committee
700	1		_aFujiwara, Okitsugu, _eExamination Committee
710	2		_aGovernment of Switzerland, _eScholarship Donor
810	2		_aAsian Institute of Technology. _tSpecial studies project report ; _vno. IE-82-09
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B21104
907			_a.b10064904 _bmnait _cy
902			_a240815
998			_b3 _c951012 _dm _ea _fy _g0
945			_lmnait
945			_lmnarc
942			_c22
942			_c40
909			_aBarcode : 30050120567945 _bCREATED : 2013-10-06 _cRECORD # : i12730993 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050120346415 _bCREATED : 2016-06-17 _cRECORD # : i13043420 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c3656 _d3656