An Effective Markov Chain Model and Branch-and-Bound Search Strategy for Wafer Fabrication Scheduling with Uncertain Process Requirements.
Journal
Proceedings of the 2001 IEEE International Conference on Robotics and Automation, ICRA 2001, May 21-26, 2001, Seoul, Korea
Pages
547-552
Date Issued
2001
Author(s)
Lin, Ming-Hung
Abstract
We can decide the operation order with unknown potential order requirements using the scheduling architecture proposed in the paper. First, the branch-and-bound search based on a Markov chain method is proposed. The Markov chain gets the service rate records and arrival rate records from the manufacturing execution system. We can get the possible beginning times of operations for each job via the Markov chain. The information of the possible beginning time can help us to approximate the solution space. Thus, by the information of the possible beginning times of operations, a branch-and-bound search scheduler can be used to find a sub-optimal scheduling.
Type
conference paper