An optimization approach to capacity expansion in semiconductor manufacturing facilities

International Journal of Production Research

Volumn 37, Issue 15, 1999, Pages 3359-3382

  Bard, Jonathan F ^a   Srinivasan, Krishna ^b   Tirupati, Devanath ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BATCH DATA PROCESSING; COMPUTATIONAL METHODS; COMPUTER WORKSTATIONS; DECISION THEORY; LINEAR EQUATIONS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION ENGINEERING; SIMULATED ANNEALING;

CAPACITY EXPANSION PROBLEM; MULTISERVER BATCH QUEUEING SYSTEM; PARAMETRIC DECOMPOSITION;

SEMICONDUCTOR DEVICE MANUFACTURE;

EID: 0033207649     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499190095     Document Type: Article

References (31)

1. Bard, J. F. and Feo, T. A., 1991, An algorithm for the manufacturing equipment selection problem. IIE Transactions, 23(1), 83-92.
2. Bitran, G. R. and Tirupati, D., 1988, Multiproduct queuing networks with deterministic routing: decomposition approach and the notion of interference. Management Science, 34(1), 75-100.
3. Bitran, G. R. and Tirupati, D., 1989a, Capacity planning with discrete options in manufacturing networks. Annals of Operations Research, 17, 119-136.
4. Bitran, G. R. and Tirupati, D., 1989b, Trade-off curves, targeting and balancing in manufacturing queueing networks. Operations Research, 37(4), 547-564.
5. Bitran, G. R. and Tirupati, D., 1989c, Approximations for product departures for a single server station with batch processing in multi-product queues. Management Science, 35(7), 851-878.
6. Chance, F., 1993, DELPHI, A C-based manufacturing simulator. Version 8, Level 27, Sematech, Austin, TX; updated versions with Wright Williams & Kelly, Pleasanton, CA.
7. Connors, D. P., Fegin, G. E. and Yao, D. D., 1994, A Queueing Network Model for Semiconductor Manufacturing. (Yorktown Heights, NY: IBM Research Division).
8. Deuermeyer, B. L., Curry, G. L. and Feldman, R., 1993, An automatic modeling approach to the strategic analysis of semiconductor fabrication facilities. Production and Operations Management, 2(3), 195-220.
9. Donohue, K. L., Hopp, W. and Spearman, M., 1995, Optimal design of stochastic production lines: a dynamic programming approach. Working paper, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.
10. Feo, T A., Venkatraman, K. and Bard, J.F., 1991, A GRASP for a difficult single machine scheduling problem. Computers & Operations Research, 18(8), 635-643.
11. Heyman, D. P. and Sobel, M. J., 1982, Stochastic Models In Operations Research, Vol. I, Stochastic Processes and Operating Characteristics (New York: McGraw-Hill).
12. Johnson, D. S., Aragon, C. R., McGeoch L. A. and Schevon, C., 1989, Optimization by simulated annealing: an experimental evaluation, part 1, graph partitioning. Operations Research, 37(6), 865-892.
13. Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P., 1983, Optimization by simulated annealing. Science, 220, 671-680.
14. Kleinrock, L., 1976, Queuing Systems, Vol. II (New York: Wiley).
15. Kusiak, A., 1987, The production equipment requirements problem. International Journal of Production Research, 25(3), 319-325.
16. Lu, S. H., Ramaswamy, D. and Kumar, P. R., 1994, Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants. IEEE Transactions Semiconductor Manufacturing, 7, 374-388.
17. Miller, D. M. and Davis, R. P., 1978, A dynamic resource allocation model for a machine requirements problem. AIIE Transactions, 10(3), 237-243.
18. Narahari, Y. and Khan, L. M., 1996, Performance analysis of scheduling policies in reentrant manufacturing systems. Computers & Operations Research, 23(1), 37-51.
19. Robinson, J. K., Fowler, J. W. and Bard, J. F., 1995, The use of upstream and down stream information in scheduling semiconductor batch operations. International Journal of Production Research, 33(7), 1849-1869.
20. q/(1-p). Annals of the Institute of Statistical Mathematics, 29, 67-75.
21. Sarin, S. C. and Chen, C. S., 1986, A model for manufacturing system selection. In A. Kusiak (Ed.) Flexible Manufacturing Systems: Methods and Studies (Amsterdam: North-Holland) 99-112.
22. Segal, M. and Whitt, W., 1988, A queueing network analyzer for manufacturing. Proceedings of the 12th International Teletraffic Congress, Torino, Italy.
23. Srinivasan, K., 1995, Capacity Expansion with Discrete Options in Semiconductor Manufacturing Systems, MS Thesis, Department of Mechanical Engineering, University of Texas, Austin.
24. Srinivasan, K., Sandell, R. and Brown, S., 1995, Correlation between yield and waiting time: a quantitative study. Proceedings of the International Electronics Manufacturing Technology Symposium, Austin, Texas (2-4 October).
25. Uzsoy, R., Lee, C.-Y. and Martin-Vega, L. A., 1992, A review of production planning and scheduling models in the semiconductor industry. Part I: system characterization, performance evaluation and production planning. IIE Transactions on Scheduling & Logistics, 24(4), 47-60.
26. Van Laarhoven, P. J. M. and Aarts, E. H. L., 1987, Simulated Annealing: Theory and Applications (Amsterdam, The Netherlands: Kluwer Academic Publishers).
27. Wein, L., 1988, Scheduling semiconductor wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 1(3), 115-130.
28. Wein, L., 1992, On the relationship between yield and cycle time in semiconductor wafer fabrication. IEEE Transaction on Semiconductor Manufacturing, 5(2), 156-158.
29. Whitt, W, 1993, Approximations for the GI/G/m Queue. Production and Operations Management, 2, 114-116.
30. Wilhelm, M. and Ward, T, 1987, Solving quadratic assignment problems by simulated annealing. IIE Transactions, 19(1), 107-119.
31. Zegordi, S. H., Itoh, K. and Enkawa, T, 1995, A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem. International Journal of Production Research, 33(5), 1449-1466.