Chung Yee Lee

A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING

Although the national importance of the semiconductor industry is widely acknowledged, it is only recently that the production planning and scheduling problems encountered in this environment have begun to be addressed using industrial engineering and operations research.techniques. These problems have several features that make them difficult and challenging: random yields and rework, complex product flows, and rapidly changing products and technologies. Hence their solution will contribute considerably to die theory and practice of production planning and control. In a two-part project we present a review of research in this area to date, discuss the applicability of the various approaches and suggest directions for future research. In this paper, Part I, we describe the characteristics of the semiconductor manufacturing environment and review models related to performance evaluation and production planning. Part II will review research on shop-floor control in this industry to date.

Scheduling precedence graphs in systems with interprocessor communication times

The problem of nonpreemptively scheduling a set of m partially ordered tasks on n identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that the makespan

Efficient algorithms for scheduling semiconductor burn-in operations

\omega _{{\text{ETF}}}

Machine Scheduling with Availability Constraints

generated by ETF always satisfies

A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART II: SHOP-FLOOR CONTROL

\omega _{{\text{ETF}}} \leqq ({{2 - 1} / n})\omega _{{\text{opt}}}^{(i)} + C

Machine scheduling with transportation considerations

, where

Business process management: survey and methodology

\omega _{{\text{opt}}}^{(i)}

Current trends in deterministic scheduling

is the optimal makespan without considering communication delays and C is the communication requirements over some immediate predecessor-immediate successor pairs along one chain. An algorithm is also provided to calculate C. The time complexity of Algorithm ETF is

Machine scheduling with job delivery coordination

O(nm^2 )

Minimizing Makespan on a Single Batch Processing Machine with Dynamic Job Arrivals

.