Journal of System Simulation
Abstract
Abstract: The dynamic job shop has the uncertainty of resource state and the randomness of tasks,so it is difficult to find the common dispatching rules applicable to a variety of complex production scenarios.A method for automatic discovery of dynamic shop dispatching rules based on Hyper-Heuristic genetic programming is proposed,with makespan and average weighted tardiness as the optimization goals,is improved by using the automatic discovery of machine sequencing rules and the dynamic adaptability of workshop scheduling under different production scenarios.Through the semantic analysis of dispatching rules,the function of terminators on different optimization objectives is analyzed.The experiment result shows that the proposed algorithm can effectively generate appropriate dispatching rules which is obviously better than the manual designed benchmark rules for different production scenarios.
Recommended Citation
Zhang, Suyu; Yan, Wang; and Ji, Zhicheng
(2020)
"Automatic Discovery Method of Dynamic Job Shop Dispatching Rules Based on Hyper-Heuristic Genetic Programming,"
Journal of System Simulation: Vol. 32:
Iss.
12, Article 22.
DOI: 10.16182/j.issn1004731x.joss.20-FZ0452
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol32/iss12/22
First Page
2494
Revised Date
2020-07-08
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.20-FZ0452
Last Page
2506
CLC
TP391.9
Recommended Citation
Zhang Suyu, Wang Yan, Ji Zhicheng. Automatic Discovery Method of Dynamic Job Shop Dispatching Rules Based on Hyper-Heuristic Genetic Programming[J]. Journal of System Simulation, 2020, 32(12): 2494-2506.
DOI
10.16182/j.issn1004731x.joss.20-FZ0452
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons