Integer programming-based real-time scheduler in semiconductor manufacturing

Authors:
Myoungsoo Ham;Young Hoon Lee;John W. Fowler
Affiliations:
Arizona State University, Tempe, AZ;Yonsei University, Seoul, South Korea;Arizona State University, Tempe, AZ
Venue:
Winter Simulation Conference
Year:
2009

Citing 4
Cited 0

Linearization strategies for a class of zero-one mixed integer programming problems

Operations Research
Design and Analysis of Experiments

Design and Analysis of Experiments
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

Computers and Operations Research
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper demonstrates how an integer programming-based real-time scheduling heuristic approach can be applied for semiconductor manufacturing. Two integer programming formulations of a simplified version of this problem are proposed to model (1) a full-enumeration scheduling problem which minimizes the makespan (Cmax), and (2) a real-time scheduling problem which simply maximizes job assignments at the current state. The real-time scheduler's overall effectiveness in terms of solution quality and run time is evaluated through computer experiments. The real time scheduler is based on an iterative procedure to calculate the makespan, where a simulator is developed to read the integer programming output and to update the job and machine information at each state. The experimental study shows how a well-defined integer programming-based real-time scheduling heuristic can generate a near-optimal solution.