Article ID Journal Published Year Pages File Type
473379 Computers & Operations Research 2012 16 Pages PDF
Abstract

Wafer fabrication is a capital-intensive and highly complex manufacturing process. In the wafer fabrication facility (fab), wafers are grouped as a lot to go through repeated sequences of operations to build circuitry. Lot scheduling is an important task for manufacturers to improve production efficiency and meet customers’ requirements of on-time delivery. In this research we propose a dispatching rule for lot scheduling in wafer fabs, focusing on three due date-based objectives: on-time delivery rate, mean tardiness, and maximum tardiness. Although many dispatching rules have been proposed in the literature, they usually perform well in some objectives and bad in others. Our rule implements good principles in existing rules by means of (1) an urgency function for a single lot, (2) a priority index function considering total urgency of multiple waiting lots, (3) a due date extension procedure for dealing with tardy lots, and (4) a lot filtering procedure for selecting urgent lots. Simulation experiments are conducted using nine data sets of fabs. Six scenarios formed by two levels of load and three levels of due date tightness are tested for each fab. Performance verification of the proposed rule is achieved by comparing with nine benchmark rules. The experimental results show that the proposed rule outperforms the benchmark rules in terms of all concerned objective functions.

► We propose a dispatching rule for lot scheduling in wafer fabs regarding due date-based objectives. ► The rule prioritizes lots by the impact on the total urgency of competing lots. ► The rule deals with tardy lots by a due date extension mechanism. ► We conduct extensive experiments using nine fab models, six scenarios, and nine benchmark rules. ► Our rule performs well in terms of on-time delivery rate, mean tardiness, and maximum tardiness.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,