dc.creator | Papadopoulos, H. T. | en |
dc.creator | Vidalis, M. I. | en |
dc.date.accessioned | 2015-11-23T10:43:12Z | |
dc.date.available | 2015-11-23T10:43:12Z | |
dc.date.issued | 2001 | |
dc.identifier | 10.1016/s0925-5273(00)00056-6 | |
dc.identifier.issn | 0925-5273 | |
dc.identifier.uri | http://hdl.handle.net/11615/31731 | |
dc.description.abstract | This work deals with the well-known buffer allocation problem in short reliable production lines. The objective is to find the optimal buffer allocation (OBA) that minimizes the average work-in-process (WIP) inventory, subject to a minimum required throughput. The study leads to some insights concerning the evolution of the throughput and WIP as a function of the ordered buffer allocations. In the case of balanced lines, it is observed that the so-called self-similarity phenomenon prevails. It is also pointed out that the choice of the throughput level is critical for finding the OBA that minimizes the average WIP. Also a heuristic algorithm is proposed to find the OBA, which reduces the search space by over 50% compared to enumeration. (C) 2001 Elsevier Science B.V. All rights reserved. | en |
dc.source | International Journal of Production Economics | en |
dc.source.uri | <Go to ISI>://WOS:000167512300007 | |
dc.subject | stochastic modelling | en |
dc.subject | production lines | en |
dc.subject | optimization | en |
dc.subject | buffer allocation | en |
dc.subject | WIP inventory | en |
dc.subject | heuristic algorithms | en |
dc.subject | self-similarity | en |
dc.subject | STORAGE SPACE | en |
dc.subject | SYSTEMS | en |
dc.subject | ALLOCATION | en |
dc.subject | TIMES | en |
dc.subject | Engineering, Industrial | en |
dc.subject | Engineering, Manufacturing | en |
dc.subject | Operations Research | en |
dc.subject | & Management Science | en |
dc.title | Minimizing WIP inventory in reliable production lines | en |
dc.type | journalArticle | en |