About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CIM 1992
Conference paper
Scheduling semiconductor lines using a fluid network model
Abstract
We present a novel method for "what's next" scheduling of semiconductor manufacturing lines based on the deterministic fluid network model of Chen and Yao [1]. By "what's next" scheduling we mean specifying the order in which jobs are processed at each tool group. The approach we take here is first to determine how to allocate tool capacity among competing job types by solving a series of linear and quadratic programming problems related to the fluid model and then to specify a "what's next" scheduling algorithm designed to track these capacity allocations. The primary advantage of our approach is that it gives rise to a schedule which is based on global rather than local state information and which is responsive to stochastic changes in the line including tool incapacitation events and operator unavailability. In addition to describing the scheduling algorithm, we present some results about the fluid model that have important implications in the context of semiconductor manufacturing.