Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Neureuther, Brian D.
Affiliations: Analytical Department, School of Business, Indiana State University, Terre Haute, IN 47809. E-mail: [email protected]
Abstract: The development of Little's Law has been shown to give relatively precise and replicable estimates of the true cycle time in a variety of production (or network queuing) systems. The majority of the work performed using Little's Law has been done with queuing systems involving single products and single operations. However many queuing systems, such as semiconductor fabrication, are much more complex and involve several products with hundreds of operations. In this paper we compare the expected cycle time as computed by Little's Law to the actual cycle time determined from simulation analysis in a single and multiple product, multiple operation semiconductor fabrication system (a network queue environment). It was found that under simple environments, Little's Law works well. However, in complex job shop processes, such as semiconductor manufacturing, it does not. Factors that cause Little's Law to break down and the factors that are required to accurately estimate cycle time in complex job shops are addressed.
Journal: Journal of Integrated Design & Process Science, vol. 6, no. 3, pp. 93-104, 2002
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]