000			03229nam a2200385 4500
005			20260817163740.0
008			230698 th eng
035			_a.b10099761
099		9	_aAIT Thesis no.IE-87-04
100	0		_aLa-ead Kovavisaruch
245	1	0	_aAssignment and routing of maintenance technicians : _bthe case of a computer service system
260			_aBangkok : _bAsian Institute of Technology, _c1987
300			_a53, [97] p.
490	1		_aThesis ; _vno. IE-87-04
500			_aA thesis report submitted in partial fulfillment of t he requirements for the degree of Master of Engineering, School of Engineering and Technology
502			_aThesis (M.Eng.) - Asian Institute of Technology,1987
520			_aA heuristic approach for solving the vehicle routing problem (VRP) is formulated and applied to a case study on the assignment and routing problem of maintenance technicians. To suit the requirements of the study, a dynamic aspect is introduced to the original algorithm. A network of the main streets in Bangkok is defined and the shortest path is computed. For estimating travel time, a travel time-distance conversion model is constructed using regression analysis. To fulfill the objectives of the study, a micro-computer based system package for solving assignment and routing problems was developed and tested. Results obtained from the new system are compared with those from the current system. It reveals that an 18.5% in crease from 13.09 for the average complete jobs by manual assignment to 15.51 by computer method in each day. And it can be ensured by 95% confidence interval that assigning the repair jobs to the technicians by the developed system is better off. The interactive approach of the proposed system is also presented. The number of technicians needed is affected by two parameters, namely, frequency of program runs and maximum delay time. These parameters can be adjusted to a certain level of service satisfaction by the management. Finally, from the computational experiences in using the developed model, only a few seconds are needed for operating the program. In other words, the response time of the computer process is at an acceptable level.
650		0	_aScheduling (Management)
700	1		_aTabucanon, Mario T., _eChairperson
700	1		_aOudheusden, Dirk L. van, _eExamination Committee
700	0		_aKanchlt Malalvongs, _eExamiantion Committee
710	2		_aAsian Institute of Technology Partial, _eScholarship Donor
810	2		_aAsian Institute of Technology. _tThesis ; _vno. IE-87-04
856			_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B19331
907			_a.b10099761 _bmnait _cs
902			_a240419
998			_b2 _c951012 _dm _ea _fs _g0
945			_lmnait
945			_lmnarc
942			_c22
942			_c40
909			_aBarcode : 30050120821581 _bCREATED : 2014-02-05 _cRECORD # : i1279580x _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
909			_aBarcode : 30050160010517 _bCREATED : 2016-04-18 _cRECORD # : i12936959 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0
999			_c9606 _d9606