产能规划
晶圆制造
布线(电子设计自动化)
半导体器件制造
约束(计算机辅助设计)
产品(数学)
对偶(语法数字)
订单履行
吞吐量
数学优化
计算机科学
点(几何)
运筹学
工程类
薄脆饼
运营管理
数学
计算机网络
供应链
法学
文学类
电信
艺术
政治学
几何学
机械工程
电气工程
无线
作者
Muh-Cherng Wu,Chen-Fu Chen,Chang-Fu Shih
标识
DOI:10.1080/00207540802172029
摘要
This paper formulates and solves a route planning problem for semiconductor manufacturing. In order to quickly respond to rising demand, a semiconductor company usually adopts a dual-fab strategy to expand capacity. That is, two fab sites are built as neighbours and can easily share capacity. Through the capacity-sharing design, a product may be produced by a cross-fab route. That is, some operations of a product are carried out in one fab and the other operations in the other fab. This leads to a routing planning problem, which involves two decisions–determining the cut-off point of the cross-fab route and the route ratio for each product–in order to maximise the throughput subject to a cycle time constraint. An LP-GA method is proposed to solve the route planning problem. We first use the LP module to make the cut-off point decisions, and proceed to use the GA module for making the decision on the route ratio. Experimental results show that the LP-GA method significantly outperforms other methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI