EFFICIENT SCHEDULING POLICIES TO REDUCE MEAN AND VARIANCE OF CYCLE-TIME IN SEMICONDUCTOR MANUFACTURING PLANTS

被引:247
作者
LU, SCH [1 ]
RAMASWAMY, D [1 ]
KUMAR, PR [1 ]
机构
[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801
基金
美国国家科学基金会;
关键词
714.2 Semiconductor Devices and Integrated Circuits - 731.3 Specific Variables Control - 913.2 Production Control - 921.6 Numerical Methods;
D O I
10.1109/66.311341
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of reducing the mean and variance of cycle time in semiconductor manufacturing plants is addressed. Such plants feature a characteristic reentrant process flow, where lots repeatedly return at different stages of their production to the same service stations for further processing, consequently creating much competition for machines. We introduce a new class of scheduling policies, called Fluctuation Smoothing policies. Unanimously, our policies achieved the best mean cycle time and Standard Deviation of Cycle Time, in all the configurations of plant models and release policies tested. As an example, under the recommended Workload Regulation Release policy, for a heavily loaded Research and Development Fabrication Line model, our Fluctuation Smoothing policies achieved a reduction of 22.4% in the Mean Queueing Time, and a reduction of 52.0% in the Standard Deviation of Cycle Time, over the baseline FIFO policy. These conclusions are based on extensive simulations conducted on two models of semiconductor manufacturing plants. The first is a model of a Research and Development Fabrication Line that has been developed and studied earlier by Wein [1]. The second is an aggregate model intended to approximate a full scale production line. Statistical tests are used to corroborate our conclusions.
引用
收藏
页码:374 / 388
页数:15
相关论文
共 16 条
[1]  
CHEVALIER PB, IN PRESS OPERATIONS
[2]  
Conway RW., 1967, THEORY SCHEDULING
[3]   CLOSED-LOOP JOB RELEASE CONTROL FOR VLSI CIRCUIT MANUFACTURING [J].
GLASSEY, CR ;
RESENDE, MGC .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 1988, 1 (01) :36-46
[4]   SCHEDULING NETWORKS OF QUEUES - HEAVY TRAFFIC ANALYSIS OF A 2-STATION CLOSED NETWORK [J].
HARRISON, JM ;
WEIN, LM .
OPERATIONS RESEARCH, 1990, 38 (06) :1052-1064
[5]  
Inc S. P. S. S., 1988, SPSS X USERS GUIDE
[6]  
Kleinrock L., 1975, QUEUEING SYST
[7]  
Kleinrock L., 1976, QUEUEING SYSTEMS
[8]  
Kumar P. R., 1993, Queueing Systems Theory and Applications, V13, P87, DOI 10.1007/BF01158930
[9]  
LEHMANN EL, 1986, TESTING STATISTICAL
[10]   BOTTLENECK STARVATION INDICATORS FOR SHOP FLOOR CONTROL [J].
LOZINSKI, C ;
GLASSEY, CR .
IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 1988, 1 (04) :147-153