Multi-objective Job Shop Rescheduling with Estimation of Distribution Algorithm
To solve the moJSRP model, with the framework of proposed MoEDA, the probability model of the operation sequence is estimated firstly. For sampling the processing time of each operation with the Monte Carlo methods, allocation method is used to decide the operation sequence, and then the expected makespan and total tardiness of each sampling are evaluated. Subsequently, updating mechanism of the probability models is proposed according to the best solutions to obtain. Finally, for comparing with some existing algorithms by numerical experiments on the benchmark problems, we demonstrate the proposed effective estimation of distribution algorithm can obtain an acceptable solution in the aspects of schedule quality and computational efficiency.
KeywordsJob shop rescheduling Multi-objective optimization Estimation of distribution algorithms
This work is partly supported by the National Natural Science Foundation of China under Grant 61572100, and in part by the Grant-in-Aid for Scientific Research (C) of Japan Society of Promotion of Science (JSPS) No. 15K00357.
- 1.Cauty R (2000) Genetic algorithms and engineering optimization. Wiley, New YorkGoogle Scholar
- 5.Kempf K (1994) Intelligently scheduling semiconductor wafer fabrication. In: Intelligent Scheduling, pp 517–544Google Scholar
- 10.Zitzler E, Laumanns M, Thiele L (2001) SPEA 2: improving the strength pareto evolutionary algorithm. In: Evolutionary methods for design, optimization and control. CIMNE, BarcelonaGoogle Scholar