A Scheduling Optimization Algorithm based on Graph Theory and Simulated Annealing
| Autor: | Yanwei Shang, Lin Qiang, Xijun Lin |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Vertex (graph theory)
Mathematical optimization Computer science Node (networking) Scheduling (production processes) 020207 software engineering Graph theory 02 engineering and technology Dynamic priority scheduling Shortest path problem Simulated annealing 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Pruning (decision trees) |
| Zdroj: | 2021 6th International Conference on Inventive Computation Technologies (ICICT). |
| Popis: | This paper analyzes the current situation and limitations of scheduling, where it combines the vertex coloring theory of graph theory to form the initial scheduling table; marks the dynamic edges according to the conflict rules; uses the node subtree pruning shortest path method; the simulated annealing algorithm to solve the problem of scheduling conflict so as to balance the complexity associated with time and rationality of personnel arrangement in order to achieve an automated scheduling. The proposed methodology uses the data mining and intelligent model to construct the efficient approach. The experiment results have proven the overall effectiveness. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|