| 000 | 03118nam a2200457 4500 | ||
|---|---|---|---|
| 005 | 20260817171926.0 | ||
| 008 | 240698 th eng | ||
| 035 | _a.b1012391x | ||
| 099 | 9 | _aAIT Thesis no. IE-88-28 | |
| 100 | 0 | _aSumalee Jirapongsananuruk | |
| 245 | 1 | 0 | _aBus drivers scheduling solved on the microcomputer |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1988 |
||
| 300 | _a165 p. | ||
| 490 | 1 |
_aThesis ; _vno. IE-88-28 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology | ||
| 502 | _aThesis (M.Sc.) - Asian Institute of Technology, 1988 | ||
| 520 | _aIn Public Transportation companies the scheduling of bus drivers is one of the most costly and time consuming problems to be solved. Its solution consists of two main phases : first the list of duties needed to satisfy the daily service requirement is prepared ; then allocate or sequence these duties over a planning period to make the work plans for individual drivers. A computer program is written to solve this problem on the microcomputer. For the first phase, three methods have been proposed. These are (1) mathematical programming method ; (2) improvement of the manual scheduling method and (3 ) integration of method 1 and method 2. The solutions from these three methods are different and it seems that method 3 is most appropriate for the case of the Bangkok Mass Transit Authority. The second phase is a problem for drivers in a given time horizon, even distribution of the revenue dayoff constraint. This problem is assignment problem. | ||
| 650 | 0 | _aScheduling (management) | |
| 650 | 0 | _aMicrocomputers | |
| 650 | 0 | _aBus drivers | |
| 700 | 1 |
_aOudheusden, Dirk L. van, _eChairpeson |
|
| 700 | 1 |
_aHuynh, Ngoc Phien, _eExamination Committee |
|
| 700 | 1 |
_aBohez, Erik L.J., _eExamination Committee |
|
| 710 | 2 |
_aGovernment of Australia, _eScholarship Donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. IE-88-28 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B18752 |
||
| 907 |
_a.b1012391x _bmnait _cs |
||
| 902 | _a250625 | ||
| 998 |
_b2 _c951012 _dm _ea _fs _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050003072542 _bCREATED : 1995-10-13 _cRECORD # : i10139849 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050003072559 _bCREATED : 1995-10-13 _cRECORD # : i10139850 _dLPATRON : 1010987 _eLCHKIN : 1999-06-17 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 1 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160010137 _bCREATED : 2016-04-19 _cRECORD # : i12938403 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050121000896 _bCREATED : 2021-03-03 _cRECORD # : i1333041x _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c14124 _d14124 |
||