標題: | Minimizing the total machine workload for the wafer probing scheduling problem |
作者: | Pearn, WL Chung, SH Yang, MH 工業工程與管理學系 Department of Industrial Engineering and Management |
公開日期: | 1-二月-2002 |
摘要: | The Wafer Probing Scheduling Problem (WPSP) is a practical generalization of the parallel-machine scheduling problem, which has many real-world applications, particularly, in the Integrated Circuit (IC) manufacturing industry. In the wafer probing factories, the jobs are clustered by their product types, which must be processed on groups of identical parallel machines and be completed before the due dates. The job processing time depends on the product type, and the machine setup time is sequentially dependent on the orders of jobs processed. Since the wafer probing scheduling problem involves constraints on job clusters, job-cluster dependent processing time, due dates, machine capacity, and sequentially dependent setup time, it is more difficult to solve than the classical parallel-machine scheduling problem. In this paper, we consider the WPSP and formulate the WPSP as an integer programming problem to minimize the total machine workload. We demonstrate the applicability of the integer programming model by solving a real-world example taken from a wafer probing shop floor in an IC manufacturing factory. |
URI: | http://dx.doi.org/10.1023/A:1011952232282 http://hdl.handle.net/11536/29032 |
ISSN: | 0740-817X |
DOI: | 10.1023/A:1011952232282 |
期刊: | IIE TRANSACTIONS |
Volume: | 34 |
Issue: | 2 |
起始頁: | 211 |
結束頁: | 220 |
顯示於類別: | 期刊論文 |