An effective approach for job-shop scheduling with uncertain processing requirements
In this paper, we can decide the operation order with unknown potential order requirements. The scheduling architecture is proposed in this paper, First, the branch-andbound search based on Markov chain method is proposed. The Markov chain gets the service rate records and arrival rate records from the MES(manufacturing execution system). We can get the possible beginning times of operations for each job via 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 nd a sub-optimal scheduling.