4.3 Article

Automated application processing

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Information Systems

A Scheduling Optimization Algorithm based on Graph Theory and Simulated Annealing

Xijun Lin et al.

Summary: This paper analyzes the current situation and limitations of scheduling, proposing a methodology that combines graph theory, dynamic edge marking, shortest path methods, and simulated annealing algorithm to achieve automated scheduling and balance the complexity associated with time and personnel arrangement. The experiment results confirm the overall effectiveness of the approach.

PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON INVENTIVE COMPUTATION TECHNOLOGIES (ICICT 2021) (2021)

Article Computer Science, Information Systems

Effective and Efficient Dynamic Graph Coloring

Long Yuan et al.

PROCEEDINGS OF THE VLDB ENDOWMENT (2017)