半导体封装测试生产线排产研究

姚丽丽; 史海波; 刘昶

doi:10.3724/SP.J.1004.2014.00892

半导体封装测试生产线排产研究

doi: 10.3724/SP.J.1004.2014.00892

1.
中国科学院沈阳自动化研究所沈阳 110016;
2.
中国科学院大学北京 100049

基金项目:

国家重大专项资助项目（2011ZX02601-005）资助

详细信息

作者简介:
史海波中国科学院沈阳自动化研究所研究员. 2003 年获得哈尔滨工业大学博士学位. 主要研究方向为生产运作与管理、制造执行系统技术.

计量
- 文章访问数: 1551
- HTML全文浏览量: 34
- PDF下载量: 871
- 被引次数: 0
出版历程
- 收稿日期: 2013-01-31
- 修回日期: 2013-08-12
- 刊出日期: 2014-05-20

Research on Scheduling in Semiconductor Assembly and Test Manufacturing

1.
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016;
2.
University of Chinese Academy of Sciences, Beijing 100049

Funds:

Supported by National Science and Technology Major Project of the Ministry of Science and Technology of China (2011ZX0260 1-005)

摘要

摘要: 以某半导体封装测试（Semiconductor assembly and test manufacturing，ATM）企业为研究背景，对半导体封装测试的生产过程进行分析总结，提出一种新的“产能限定混线车间”（Capacity-limit flexible flow-shop，CLFFS）模型作为半导体封装测试生产线的排产模型.通过对半导体封装测试的特殊逻辑处理、排产方法以及排产规则等进行研究，提出采用逻辑约束和调度规则双层优化控制的启发式正序排产算法作为半导体封装测试的总体排产方法，同时针对批准备单处理生产阶段，提出一种新的预测开机控制优化调度方法.最后，结合CLFFS排产模型和所提出的策略方法，给出半导体封装测试排产的应用研究示例与比较，结果证明本文给定的总体排产方法在ATM中具有很好的可行性和业务逻辑嵌入的即便性，同时本文所提出的新的预测开机控制优化调度方法能够很好的缩短生产周期，提高生产效率.
- 半导体封装测试 /
- 产能限定混线车间 /
- 启发式算法 /
- 正序排产
Abstract: Taking one semiconductor assembly and test manufacturing (ATM) enterprise as the study object, this paper analyzes and summarizes the production process of ATM, and proposes a new model which is named capacity-limit flexible flow-shop (CLFFS) as the scheduling model of ATM. By researching on the special scheduling logic constraints, strategies, and rules of scheduling in ATM, we propose a forward heuristics algorithm which is controlled by both logic constraints and scheduling rules as the general method, and present a novel predictive control scheduling algorithm in batch-prepared one-processed stage. Finally, using the proposed model and method, an application example of scheduling in ATM and comparison are given. The results show that the general method has the effectiveness in practical application and can conveniently embed logic constraints, and that the novel predictive control scheduling algorithm can shorten production cycle and improve enterprise production benefit.
- Semiconductor assembly and test manufacturing (ATM) /
- capacity-limit flexible flow-shop (CLFFS) /
- heuristic algorithm /
- forward scheduling

HTML全文

参考文献(23)

[1]	Liao D Y, Chang S C, Pei K W, Chang C M. Daily scheduling for R&D semiconductor fabrication. IEEE Transactions on Semiconductor Manufacturing, 1996, 9(4): 550-561
[2]	Xuan H Y, Li B. Dynamic hybrid flowshop scheduling with batching production. Applied Mechanics and Materials, 2011, 65: 562-567
[3]	Wu Qi-Di, Qiao Fei, Li Li, Wang Zun-Tong. Semiconductor Manufacturing System Scheduling. Shanghai: Publishing House of Electronics Industry, 2006. 6-7(吴启迪, 乔非, 李莉, 王遵彤. 半导体制造系统调度. 上海: 电子工业出版社, 2006. 6-7)
[4]	Garcia-Sabater J P, Maheut J, Garcia-Sabater J J. A two-stage sequential planning scheme for integrated operations planning and scheduling system using MILP: the case of an engine assembler. Flexible Services and Manufacturing Journal, 2012, 24(2): 171-209
[5]	Xiao J, Li Z. A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing. In: Proceedings of the 2010 Automation Science and Engineering. Toronto, Canada: IEEE, 2010. 87-92
[6]	Pesch E, Sterna M. Late work minimization in flow shops by a genetic algorithm. Computers and Industrial Engineering, 2009, 57(4): 1202-1209
[7]	Li Yan-Jun, Wu Tie-Jun. A nested hybrid ant colony algorithm for hybrid production scheduling problems. Acta Automatica Sinica, 2003, 29(1): 95-101
[8]	Song Y, Zhang M T, Yi J G, Zhang L, Li Z. Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization. IEEE Transactions on Automation Science and Engineering, 2007, 4(4): 569-578
[9]	Jiang Yi-Wei, Wei Qi. An improved algorithm for a hybrid flow-shop problem in graphics processing. Acta Automatica Sinica, 2011, 37(11): 1381-1386
[10]	Lu S H, Kimar P R. Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control, 1991, 36(12): 1406-1416
[11]	Huang Xiao-Ling, Chai Tian-You. Application of planning and scheduling cascade model of complex system processing to mineral processing MES system. Acta Automatica Sinica, 2011, 37(9): 1130-1139
[12]	Qu Guo-Qiang. Bottleneck focused heuristic algorithm for hybrid flow shop scheduling problem. Information and Control, 2012, 41(4): 514-521, 528(屈国强. 瓶颈指向的启发式算法求解混合流水车间调度问题. 信息与控制, 2012, 41(4): 514-521, 528)
[13]	Lu S H, Ramaswamy D, Kumar P R. Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants. IEEE Transactions on Semiconductor Manufacturing, 1994, 7(3): 374-385
[14]	Uzsoy R, Lee C Y, Martin-Vega L A. A review of production planning and scheduling models in the semiconductor industry Part II: shop-floor control. Institute of Industry Engineers Transactions, 1994, 26(5): 44-55
[15]	Tovia F, Mason S J, Ramasami B. A scheduling heuristic for maximizing wirebonder throughput. IEEE Transactions on Electronics Packaging Manufacturing, 2004, 27(2): 145-150
[16]	Chua T J, Cai T X, Yin X F. A heuristic approach for scheduling multi-chip packages for semiconductor backend assembly. In: Proceedings of the 2007 IEEE Conference on Emerging Technologies and Factory Automation. Patras, Greece: IEEE, 2007. 1024-1030
[17]	Chua T J, Wang F Y, Cai T X, Yin X F. A heuristics-based advanced planning and scheduling system with bottleneck scheduling algorithm. In: Proceedings of the 2006 IEEE Conference on Emerging Technologies and Factory Automation. Hamburg, Germany: IEEE, 2006. 240-247
[18]	Yin X F, Chua T J, Wang F Y, Liu M W, Cai T X, Yan W J, Chong C S, Zhu J P, Lam M Y. A rule-based heuristic finite capacity scheduling system for semiconductor backend assembly. International Journal of Computer Integrated Manufacturing, 2004, 17(8): 733-749
[19]	Liao C J, Tjandradjaja E, Chung T P. An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Applied Soft Computing, 2012, 12(6): 1755-1764
[20]	Wang S J, Liu M. A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Computers and Operations Research, 2013, 40(4): 1064-1075
[21]	Wang Sheng-Yao, Wang Lin, Xu Ye, Zhou Gang. An estimation of distribution algorithm for solving hybrid flow-shop scheduling problem. Acta Automatica Sinica, 2012, 38(3): 437-443(王圣尧, 王凌, 许烨, 周刚. 求解混合流水车间调度问题的分布估计算法. 自动化学报, 2012, 38(3): 437-443)
[22]	Wang Ling, Zhou Gang, Xu Ye, Jin Yi-Hui. Advances in the study on hybrid flow-shop scheduling. Control and Instruments in Chemical Industry, 2011, 38(1): 1-8, 22(王凌, 周刚, 许烨, 金以慧. 混合流水线调度研究进展. 化工自动化及仪表, 2011, 38(1): 1-8, 22)
[23]	Panwalkar S S, Iskander W. A survey of scheduling rules. Operations Research, 1977, 25(1): 45-61