完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHuang, MGen_US
dc.contributor.authorChang, PLen_US
dc.contributor.authorChou, YCen_US
dc.date.accessioned2014-12-08T15:42:49Z-
dc.date.available2014-12-08T15:42:49Z-
dc.date.issued2002-02-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0305-0548(00)00060-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/29035-
dc.description.abstractThis study investigates the buffer allocation strategy of a flow-shop-type production system that possesses a given total amount of buffers and finite buffer capacity for each workstation as well as general interarrival and service times in order to optimize such system performances as minimizing work-in-process, cycle time and blocking probability, maximizing throughput, or their combinations. In theory, the buffer allocation problem is in itself a difficult NP-hard combinatorial optimization problem, it is made even more difficult by the fact that the objective function is not obtainable in closed form for interrelating the integer decision variables (i.e., buffer sizes) and the performance measures of the system. Therefore, the purpose of this paper is to present an effective design methodology for buffer allocation in the production system. Our design methodology uses a dynamic programming process along with the embedded approximate analytic procedure for computing system performance measures under a certain allocation strategy. Numerical experiments show that our design methodology can quickly and quite precisely seek out the optimal or sub-optimal allocation strategy for most production system patterns. Scope and purpose Buffer allocation is an important, yet intriguingly difficult issue in physical layout and location planning for production systems with finite floor space. Adequate allocation and placement of available buffers among workstations could help to reduce work-in-process, alleviate production system's congestion and even blocking, and smooth products manufacturing flow. In view of the problem complexity, we focus on flow-shop-type production systems with general arrival and service patterns as well as finite buffer capacity. The flow-shop-type lines, which usually involve with product-based layout, play an important role in mass production type of manufacturing process organization such as transfer line, batch flow line, etc. The purpose of this paper is to present a design methodology with heuristic search and imbedded analytic algorithm of system performances for obtaining the optimal or sub-optimal buffer allocation strategy. Successful use of this design methodology would improve the production efficiency and effectiveness of flow-shop-type production systems. (C) 2001 Elsevier Science Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectbuffer allocationen_US
dc.subjectopen tandem general queueing networksen_US
dc.subjectblockingen_US
dc.subjectdynamic programmingen_US
dc.titleBuffer allocation in flow-shop-type production systems with general arrival and service patternsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0305-0548(00)00060-5en_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume29en_US
dc.citation.issue2en_US
dc.citation.spage103en_US
dc.citation.epage121en_US
dc.contributor.department經營管理研究所zh_TW
dc.contributor.departmentInstitute of Business and Managementen_US
dc.identifier.wosnumberWOS:000171507100001-
dc.citation.woscount19-
顯示於類別:期刊論文


文件中的檔案:

  1. 000171507100001.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。