03634nam a2200421 4500 20260817162305.0 th eng .b11711607 AIT Thesis no. ISE-97-30 Setya Murdapa Analysis of a stochastic multistage production line system under CONWIP/Finite buffers control by decomposition Bangkok : Asian Institute of Technology, 1997 73 p. Thesis ; no. ISE-97-30 A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies Thesis (M.Eng.) - Asian Institute of Technology, 1997 In 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. Assembly-line methods Buffer storage (Computer science) Nagarur, Nagendra N., Chairperson Pastijn, Hugo, Examination committee Pandey, P.C., Examination committee Slamet Rijadi Foundation Yogyakarta, Indonesia, Scholarship donor Asian Institute of Technology. Thesis ; no. ISE-97-30 Full-Text http://203.159.5.9/ait-thesis/detail.php?q=B14398 .b11711607 mnait y 240403 0 980521 m a y 0 mnait mnait mnarc 20 40 Barcode : 30050120815328 CREATED : 1998-05-21 RECORD # : i12069115 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 Barcode : 30050120815310 CREATED : 1998-05-21 RECORD # : i12069127 LPATRON : 1016514 LCHKIN : 2004-08-23 # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 5 TOT RENEW : 1 Barcode : 30050160099148 CREATED : 2016-04-28 RECORD # : i12959728 LPATRON : 0 LCHKIN : - # RENEWALS : 0 # OVERDUE : 0 IUSE3 : 0 TOT CHKOUT : 0 TOT RENEW : 0 4573 4573 0 0 0 0 MAIN MAIN mnait 2026-08-17 0 AIT Thesis no. ISE-97-30 30050120815328 2026-08-17 16:23:05 1 2026-08-17 20 0 0 0 0 MAIN MAIN mnait 2026-08-17 0 AIT Thesis no. ISE-97-30 30050120815310 2026-08-17 16:23:05 2 2026-08-17 20 0 0 0 0 MAIN MAIN mnarc 2026-08-17 0 AIT Thesis no. ISE-97-30 30050160099148 2026-08-17 16:23:05 1 2026-08-17 40