Please use this identifier to cite or link to this item:
|Title:||On the role of a queueing network model in the design of a complex assembly system|
|Authors:||Zhuang, L. |
|Source:||Zhuang, L.,Wong, Y.S.,Fuh, J.Y.H.,Yee, C.Y. (1998-04). On the role of a queueing network model in the design of a complex assembly system. Robotics and Computer-Integrated Manufacturing 14 (2) : 153-161. ScholarBank@NUS Repository.|
|Abstract:||This paper describes the modeling, analysis and re-design of a complex assembly system consisting of many processes (assembly, testing and inspection) and resources (machines and operators) and an advanced material handling system with intricate routing logics. It presents a systematic approach using both analytical and simulation models for the evaluation and modification of the complex assembly system. It demonstrates the application of a queueing network model to quickly generate rough-cut solutions and provide qualitative information for the evaluation of design alternatives. Iteratively, processes and resources that affect the system performance are identified, one at a time, and the system modified accordingly, until a satisfactory performance is obtained. The preliminary analyses using the queueing network model help to identify bottleneck processes, estimate optimal pallets, and determine a more efficient system layout. The use of the analytical model significantly reduces the number of the lengthy simulation runs. A detailed simulation model is subsequently employed for fine-tuning and further improvement. Compared with the original design, significant improvements have been made: a higher throughput, a reduced cycle time with less operators, and lower WIP inventories. © 1998 Elsevier Science Ltd. All rights reserved.|
|Source Title:||Robotics and Computer-Integrated Manufacturing|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 15, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.