A multi-criteria approach for scheduling semiconductor wafer fabrication facilities

Authors:
Michele E. Pfund;Hari Balasubramanian;John W. Fowler;Scott J. Mason;Oliver Rose
Affiliations:
Supply Chain Management Department, Arizona State University, Tempe, USA 85287;Department of Health Sciences Research, Mayo Clinic, Rochester, USA 55905;Department of Industrial Engineering, Arizona State University, Tempe, USA 85287-5906;Department of Industrial Engineering, University of Arkansas, Fayetteville, USA 72701;Institute for Applied Computer Science, Technical University of Dresden, Dresden, Germany 01062
Venue:
Journal of Scheduling
Year:
2008

Citing 11
Cited 9

The shifting bottleneck procedure for job shop scheduling

Management Science
Computational feasibility of multi-criteria models of production, planning and scheduling

Computers and Industrial Engineering
The one-machine problem with delayed precedence constraints and its use in job shop scheduling

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Decomposition methods for large job shops

Computers and Operations Research
Response Surface Methodology: Process and Product in Optimization Using Designed Experiments

Response Surface Methodology: Process and Product in Optimization Using Designed Experiments
Simulation Modeling and Analysis

Simulation Modeling and Analysis
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines

Computers and Operations Research
Autonomous Decentralized Scheduling Algorithm for a Job-Shop Scheduling Problem with Complicated Constraints

ISADS '99 Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
Scheduling jobs on parallel machines with setup times and ready times

Computers and Industrial Engineering

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

Computers and Operations Research
A self-adaptive agent-based fuzzy-neural scheduling system for a wafer fabrication factory

Expert Systems with Applications: An International Journal
A two-stage hybrid memetic algorithm for multiobjective job shop scheduling

Expert Systems with Applications: An International Journal
A survey of challenges in modelling and decision-making for discrete event logistics systems

Computers in Industry
Rule-based scheduling in wafer fabrication with due date-based objectives

Computers and Operations Research
Dynamic supply chain scheduling

Journal of Scheduling
Survey: Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity

Computers and Industrial Engineering
A Fuzzy Fluctuation Smoothing Rule for Job Dispatching in a Wafer Fabrication Factory: A Simulation Study

International Journal of Fuzzy System Applications
A Dynamically Optimized Fluctuation Smoothing Rule for Scheduling Jobs in a Wafer Fabrication Factory

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this research, we model a semiconductor wafer fabrication process as a complex job shop, and adapt a Modified Shifting Bottleneck Heuristic (MSBH) to facilitate the multi-criteria optimization of makespan, cycle time, and total weighted tardiness using a desirability function. The desirability function is implemented at two different levels of the MSBH: the subproblem solution procedure level (SSP level) and the machine criticality measure level (MCM level). In addition, we suggest two different methods of choosing the critical toolgroup at the MCM level: (1) the Local MCM approach, which chooses the critical toolgroup based on local desirability values from the SSP level and (2) the Global MCM approach, which chooses the critical toolgroup based on its impact on the desirability of the entire disjunctive graph. Results demonstrate the desirability-based approaches' ability to simultaneously minimize all three objectives.