scispace - formally typeset
Journal ArticleDOI

Scheduling semiconductor wafer fabrication

Reads0
Chats0
TLDR
In this paper, a variety of input control and sequencing rules are evaluated using a simulation model of a representative, but fictitious, semiconductor wafer fabrication, and the simulation results indicate that scheduling has a significant impact on average throughput time, with larger improvements coming from discretionary imput control than from lot sequencing.
Abstract
The impact that scheduling can have on the performance of semi-conductor wafer fabrication facilities is assessed. The performance measure considered is the mean throughput time (sometimes called cycle time, turnaround time or manufacturing interval) for a lot of wafers. A variety of input control and sequencing rules are evaluated using a simulation model of a representative, but fictitious, semiconductor wafer fabrication. Certain of these scheduling rules are derived by restricting attention to the sub-set of stations that are heavily utilized, and by using a Brownian network model, which approximates a multi-class queuing network model with dynamic control capability. Three versions of the wafer fabrication model, which differ only by the number of servers present at particular stations, are studied. The three versions have one, two, and four stations, respectively, that are heavily utilized (near 90% utilization). The simulation results indicate that scheduling has a significant impact on average throughput time, with larger improvements coming from discretionary imput control than from lot sequencing. The effects that specific sequencing rules have are highly dependent on both the type of input control used and the number of bottleneck stations in the fabrication. >

read more

Citations
More filters
Journal ArticleDOI

A review of production planning and scheduling models in the semiconductor industry part i: system characteristics, performance evaluation and production planning

TL;DR: A review of research in this area to date, discuss the applicability of the various approaches and suggest directions for future research is presented in this article, where the authors describe the characteristics of the semiconductor manufacturing environment and review models related to performance evaluation and production planning.
Journal ArticleDOI

Efficient algorithms for scheduling semiconductor burn-in operations

TL;DR: In this article, the problem of scheduling semiconductor burn-in operations is modeled as batch processing machines, where the processing time of a batch is equal to the largest processing time among all jobs in the batch.
Journal ArticleDOI

A review of production planning and scheduling models in the semiconductor industry part ii: shop-floor control

TL;DR: In this paper, the relationship between shop-floor control and production planning is discussed, and the relative advantages and disadvantages of the various approaches are discussed, as well as future research directions.
Journal ArticleDOI

Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants

TL;DR: In this article, a new class of scheduling policies, called fluctuation smoothing policies, were introduced to reduce the mean and variance of cycle time in semiconductor manufacturing plants, and they achieved the best performance in all configurations of plant models and release policies tested.
Journal ArticleDOI

A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations

TL;DR: Typical scheduling problems found in semiconductor manufacturing systems are identified and important solution techniques used to solve these scheduling problems are presented by means of specific examples, and known implementations are reported.
References
More filters
Journal ArticleDOI

A Proof for the Queuing Formula: L = λW

TL;DR: In this paper, it was shown that if the three means are finite and the corresponding stochastic processes strictly stationary, and if the arrival process is metrically transitive with nonzero mean, then L = λW.
Book

Reversibility and Stochastic Networks

Frank Kelly
TL;DR: This classic in stochastic network modelling broke new ground when it was published in 1979, and it remains a superb introduction to reversibility and its applications thanks to the author's clear and easy-to-read style.
Journal ArticleDOI

The Queueing Network Analyzer

TL;DR: This paper describes the Queueing Network Analyzer (QNA), a software package developed at Bell Laboratories to calculate approximate congestion measures for a network of queues and uses two parameters to characterize the arrival processes and service times.
Journal ArticleDOI

Optimal control of admission to a queueing system

TL;DR: The main emphases are on the difference between socially optimal and individually optimal (equilibrium) controls and on the use of dynamic-programming inductive analysis to show that an optimal control is monotonic or characterized by one or more "critical numbers".
Book ChapterDOI

Brownian Models of Queueing Networks with Heterogeneous Customer Populations

TL;DR: Consider an open queueing network with I single-server stations and K customer classes, where each customer class requires service at a specified station, and customers change class after service in a Markovian fashion.
Related Papers (5)