【作者】 李程；

【导师】 江志斌；

【作者基本信息】 上海交通大学 ， 管理科学与工程， 2011， 硕士

【摘要】 作为当今世界上最复杂的制造系统之一,半导体晶圆制造系统(Semiconductor Wafer Fabrication System, SWFS)存在着生产周期长,生产工艺复杂,多重入性设备,生产环境高度不稳定以及多产品同时在线生产等特点,其调度问题的求解非常困难。晶圆制造系统炉管区批处理机调度问题(scheduling of batch processor,SBP)是半导体晶圆制造系统调动与控制的一个代表性问题。批处理机的加工时间一般都大于非批处理机的加工时间且批处理机价格昂贵,半导体生产系统的瓶颈机一般为批处理机,它制约着半导体制造系统的绩效。因此,批处理加工的合理调度对改善半导体生产线的性能具有重要意义,针对炉管区批处理机问题本文所做的工作主要为:1.通过对工厂的调研,找出晶圆生产加工过程的实际生产瓶颈,并针对瓶颈问题进行了工艺分析、设备分析和流程分析,找到炉管区批处理机调度过程中的几个主要矛盾,明确了整个研究思路。2.对所研究的调度问题进行数学抽象和定义,使问题更具一般性和普遍性,通过对问题的分析过程,将复杂调度问题分解成为若干子问题进行求解,并确立了调度目标。针对半导体炉管区瓶颈设备的批处理调度问题,提出满足工艺约束和设备限制的组批调度算法。在考虑产品动态到达的基础上,根据半导体制造系统大规模、多重入、混合型生产等特征,针对Lot平均等待时间进行优化,实现多产品、多机台的实时组合派工。3.根据工厂实际设计了虚拟的晶圆制造系统(SWFS)和产品组合,并对ReS2动态调度仿真平台进行了调整和修改,使其更加符合生产实际。通过与生产过程中常用的组批方法(MaxMin)进行实验比较,验证了本文所提算法的正确性和有效性。更多还原

【Abstract】 As one of the most complex manufacturing system today, a semiconductor wafer manufacturing system (SWFS) is characterized by re-entrant process flows, complex production processes and unpredictable equipment downtime, which make the schedule of a SWFS very difficult.The scheduling of batch processor (SBP) in the furnace area has the common features of SWFS. Batch processing facilities are generally bottlenecks in manufacturing systems for a variety of reasons: They are often expensive to purchase so that the utilization of such equipment is usually very high. Furthermore, parts (jobs) usually require long and non-preemptive processing times, so that the facility is unavailable for other parts (jobs) for relatively long period. Thus, rendering an effective scheduling approach of batch processors of SWFS is an important management concern. The major contributions to SBP of this paper are as follows:1) The bottleneck of the SWFS is found in the process of observation on the real semiconductor plant, and through the analysis on process and equipment of the bottleneck, the main scheduling conflicts are found which suggests the idea and direction of the entire research.2) A mathematical model is built for this problem, and through the analysis of the scheduling problem, the complex problem can be broken down to several sub-problem, and the goals of scheduling is established. To solve the scheduling problem of batch processing machine in the furnace district of SWFS, this paper proposes a scheduling algorithm which satisfies the process constraint and equipment limitations. Considering the dynamic arrival of lots and the SWFS’s features of large scale and multiple re-entrant processes, the algorism may realize the real-time combinatory dispatching of multi-product and multi-machine by optimizing average waiting time of lots.3) The simulation based experiments are made on a virtual SWFS fab simulation platform (ReS2), which has been modified to match the real production process, and the result shows that the algorithm can significantly improve the fill rate and the utilization of the bottleneck machine and thus shorten the cycle time in real-time dispatching.更多还原