| 000 | 03634nam a2200421 4500 | ||
|---|---|---|---|
| 005 | 20260817162305.0 | ||
| 008 | th eng | ||
| 035 | _a.b11711607 | ||
| 099 | 9 | _aAIT Thesis no. ISE-97-30 | |
| 100 | 0 | _aSetya Murdapa | |
| 245 | 1 | 0 | _aAnalysis of a stochastic multistage production line system under CONWIP/Finite buffers control by decomposition |
| 260 |
_aBangkok : _bAsian Institute of Technology, _c1997 |
||
| 300 | _a73 p. | ||
| 490 | 1 |
_aThesis ; _vno. ISE-97-30 |
|
| 500 | _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies | ||
| 502 | _aThesis (M.Eng.) - Asian Institute of Technology, 1997 | ||
| 520 | _aIn recent times, there is a great pressure on production line to have minimum total inventory for getting more benefits. Some years after the success of Toyota Motor Co. applying Kanban system, a new effort to go to a lean production line is proposed, i.e. CONWIP. CONWIP sets the total inventory in constant level. However, the CONWIP assumes that the capacity of the buffers are unlimited. It is not possible in the real production line. This study is trying to observe what will happen if the CONWIP control is combined with the (TOYOTA) kanban control on a multistage production line. The idea was firstly proposed by Bonvik (I 996). In this paper, just a simple way is conducted to get the solution. Two algorithms, i.e. Frein-Commault-Dallery's algorithm for close-line system and Di Mascolo David-Dallery's algorithm for assembly/disassembly system, are combined to a new algorithm to analyze the performance of a CONWIP/Finite buffers controlled production line. This method is simple because it only uses the two-machine line formula as the basic analytical calculation in the decomposition analysis. By adding some more approximations for numerical calculating needs, the results are satisfying (with error less than 10%) compared with simulation results for less reliable production line. It means that approximating numerically the reliability of Machine S is in fact not sufficient for more/very reliable line. Anyway, an analysis of the CONWIP/Finite buffers control is conducted, though limited to this less reliable line. Hence some conclusions can be noted based on this simple numerical calculation method. | ||
| 650 | 1 | 0 | _aAssembly-line methods |
| 650 | 1 | 0 | _aBuffer storage (Computer science) |
| 700 | 1 |
_aNagarur, Nagendra N., _eChairperson |
|
| 700 | 1 |
_aPastijn, Hugo, _eExamination committee |
|
| 700 | 1 |
_aPandey, P.C., _eExamination committee |
|
| 710 | 2 |
_aSlamet Rijadi Foundation Yogyakarta, Indonesia, _eScholarship donor |
|
| 810 | 2 |
_aAsian Institute of Technology. _tThesis ; _vno. ISE-97-30 |
|
| 856 |
_3Full-Text _uhttp://203.159.5.9/ait-thesis/detail.php?q=B14398 |
||
| 907 |
_a.b11711607 _bmnait _cy |
||
| 902 | _a240403 | ||
| 998 |
_b0 _c980521 _dm _ea _fy _g0 |
||
| 945 | _lmnait | ||
| 945 | _lmnait | ||
| 945 | _lmnarc | ||
| 942 | _c20 | ||
| 942 | _c40 | ||
| 909 |
_aBarcode : 30050120815328 _bCREATED : 1998-05-21 _cRECORD # : i12069115 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 909 |
_aBarcode : 30050120815310 _bCREATED : 1998-05-21 _cRECORD # : i12069127 _dLPATRON : 1016514 _eLCHKIN : 2004-08-23 _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 5 _jTOT RENEW : 1 |
||
| 909 |
_aBarcode : 30050160099148 _bCREATED : 2016-04-28 _cRECORD # : i12959728 _dLPATRON : 0 _eLCHKIN : - _f# RENEWALS : 0 _g# OVERDUE : 0 _hIUSE3 : 0 _iTOT CHKOUT : 0 _jTOT RENEW : 0 |
||
| 999 |
_c4573 _d4573 |
||