### Abstract

This paper demonstrates how an integer programming-based real-time scheduling heuristic approach can be applied for semi-conductor 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.

Original language | English |
---|---|

Title of host publication | Proceedings of the 2009 Winter Simulation Conference, WSC 2009 |

Pages | 1657-1666 |

Number of pages | 10 |

DOIs | |

Publication status | Published - 2009 Dec 1 |

Event | 2009 Winter Simulation Conference, WSC 2009 - Austin, TX, United States Duration: 2009 Dec 13 → 2009 Dec 16 |

### Other

Other | 2009 Winter Simulation Conference, WSC 2009 |
---|---|

Country | United States |

City | Austin, TX |

Period | 09/12/13 → 09/12/16 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Modelling and Simulation
- Computer Science Applications

### Cite this

*Proceedings of the 2009 Winter Simulation Conference, WSC 2009*(pp. 1657-1666). [5429175] https://doi.org/10.1109/WSC.2009.5429175

}

*Proceedings of the 2009 Winter Simulation Conference, WSC 2009.*, 5429175, pp. 1657-1666, 2009 Winter Simulation Conference, WSC 2009, Austin, TX, United States, 09/12/13. https://doi.org/10.1109/WSC.2009.5429175

**Integer programming-based real-time scheduler in semiconductor manufacturing.** / Ham, Myoungsoo; Lee, Young Hoon; Fowler, John W.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Integer programming-based real-time scheduler in semiconductor manufacturing

AU - Ham, Myoungsoo

AU - Lee, Young Hoon

AU - Fowler, John W.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - This paper demonstrates how an integer programming-based real-time scheduling heuristic approach can be applied for semi-conductor 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.

AB - This paper demonstrates how an integer programming-based real-time scheduling heuristic approach can be applied for semi-conductor 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.

UR - http://www.scopus.com/inward/record.url?scp=77951580486&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951580486&partnerID=8YFLogxK

U2 - 10.1109/WSC.2009.5429175

DO - 10.1109/WSC.2009.5429175

M3 - Conference contribution

SN - 9781424457700

SP - 1657

EP - 1666

BT - Proceedings of the 2009 Winter Simulation Conference, WSC 2009

ER -