GRAPH COLORING PROBLEM IN THE CONTEXT OF SCHEDULE OPTIMIZATION: SOFTWARE SOLUTION
Rubrics: ARTICLES
Authors:
1.
Emperor Alexander I St. Petersburg State Transport University
2.
Emperor Alexander I St. Petersburg State Transport University
Type:
Article
Pages:
from 32
to 37
Status:
Published
Received:
11.01.2025
Accepted:
11.01.2025
Published:
11.01.2025
Subject area:
UDK УДК
Language:
Russian
Keywords:
graph, schedule, algorithm, greedy algorithm, graph coloring problem, visual representation, program, Python
Abstract (English):
This article is dedicated to the analysis of the graph coloring problem, which is relevant in various fields, including scheduling, resource planning and management, among others. During the research, this problem was adapted for optimizing the scheduling of educational activities. The main goal of the study was to create an algorithm and software for developing a user interface for scheduling in educational institutions. The developed software can be easily customized for different types of educational establishments, from schools to universities.
This article is dedicated to the analysis of the graph coloring problem, which is relevant in various fields, including scheduling, resource planning and management, among others. During the research, this problem was adapted for optimizing the scheduling of educational activities. The main goal of the study was to create an algorithm and software for developing a user interface for scheduling in educational institutions. The developed software can be easily customized for different types of educational establishments, from schools to universities.
Keywords:
graph, schedule, algorithm, greedy algorithm, graph coloring problem, visual representation, program, Python
graph, schedule, algorithm, greedy algorithm, graph coloring problem, visual representation, program, Python
1.
