| 000 | 03111cas|a2200481 i 4500 | ||
|---|---|---|---|
| 005 | 20260818084705.0 | ||
| 008 | 041198s1990 th uzm rtt 00| a1eng d | ||
| 035 | _a.b1016215x | ||
| 099 | 9 | _aAIT Diss. no. IE-90-01 | |
| 100 | 1 | _aDo, Ba Khang | |
| 245 | 1 | 0 | _aConcave cost capacitated network flows and multi-period lotsizing problems with uncertain demands |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1990 |
||
| 300 | _a105 p. | ||
| 490 | 1 |
_aDissertation ; _vno. IE-90-01 |
|
| 500 | _aA dissertation submitted in partial fulfilment of the requirements for the degree of Doctor of Technical Sciences, School of Engineering and Technology | ||
| 502 | _aThesis (Ph.D.) - Asian Institute of Technology, 1990 | ||
| 520 | _aThe dissertation considers am ultiperiod lotsizing problem on a complex production or inventory system where demaqds are random. The problem is formulated as a stochastic network flow model which also incorporates service level constraints. The model is approximated with a capacitated and deterministic network flow problem with concave cost function. A scaling method is proposed to solve this approximate flow problem. The method is efficient and produces an exact local optimum flow. The Lagrange relaxation method is also applied to find lower bounds for the optimum system cost. As an application, a stochastic coordinated multi-item lotsizing problem is considered and .solved. Some computation experiments are carried out, showing the efficiency of the new methods in handling practical problems. | ||
| 650 | 0 | _aEconomic lot size | |
| 650 | 0 | _aProduction management | |
| 700 | 1 |
_aFujiwara, Okitsugu, _eChairperson |
|
| 700 | 1 |
_aNagarur, Nagendra N., _eExamination Committee |
|
| 700 | 1 |
_aTabucanon, Mario T., _eExamination Committee |
|
| 700 | 0 |
_aVilas Wuwongse, _eExamination Committee |
|
| 700 | 1 |
_aKonno, Hiroshi, _eExamination Committee |
|
| 710 | 2 |
_aThe Government of Japan, _eScholarship Donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tDissertation ; _vno. IE-90-01 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B18156 |
||
| 907 |
_a.b1016215x _bmnait _cy |
||
| 902 | _a240510 | ||
| 998 |
_b2 _c951012 _dm _ea _fy _g0 |
||
| 945 | _lmnarc | ||
| 945 | _lmnarc | ||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 942 | _c22 | ||
| 942 | _c40 | ||
| 942 | _c20 | ||
| 909 |
_aBarcode : 30050120595565 _bCREATED : 2012-08-31 _cRECORD # : i12692050 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050160002902 _bCREATED : 2016-02-16 _cRECORD # : i12883311 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050121037104 _bCREATED : 2023-09-10 _cRECORD # : i13467517 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050121037088 _bCREATED : 2023-09-10 _cRECORD # : i13467529 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c21506 _d21506 |
||