
Application of the modified ant colony algorithm for solving the problem of scheduling of distributed enterprises
Author(s) -
Danil D. Bukhovtsev
Publication year - 2021
Publication title -
sovremennye innovacii, sistemy i tehnologii
Language(s) - English
Resource type - Journals
eISSN - 2782-2826
pISSN - 2782-2818
DOI - 10.47813/2782-2818-2021-1-1-29-42
Subject(s) - ant colony optimization algorithms , computer science , ant colony , scheduling (production processes) , job shop scheduling , mathematical optimization , schedule , algorithm , distributed computing , mathematics , operating system
The task of scheduling of distributed enterprises is to assign tasks to geographically remote enterprises and to determine a convenient work schedule for each of the enterprises. The goal of solving this problem is to minimize the total production time at all enterprises. This article is the first step towards solving the scheduling problem using different versions of the ant colony algorithm: the classic ant colony algorithm, the ant colony system algorithm, and the modified ant colony algorithm.