Nature-inspired algorithms for a scheduling problem in operational planning

The scheduling problem is a widespread one, and it is still not automatized mostly because of the so-called combinatorial explosion. The paper describes two different approaches to solving a hierarchical scheduling problem based on solution representation. The first one proposes to find an optimal o...

Full description

Saved in:
Bibliographic Details
Published in:IOP conference series. Materials Science and Engineering 2020-01, Vol.734 (1), p.12107
Main Authors: Semenkina, O E, Popov, E A
Format: Article
Language:English
Subjects:
Algorithms
Ant colony optimization
Combinatorial analysis
Genetic algorithms
Representations
Resource scheduling
Schedules
Scheduling
Water drops
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The scheduling problem is a widespread one, and it is still not automatized mostly because of the so-called combinatorial explosion. The paper describes two different approaches to solving a hierarchical scheduling problem based on solution representation. The first one proposes to find an optimal order of projects and then to solve the resource-constrained project scheduling problem for each of them. The second one assumes that we can find a priority of all activities for all projects and use it in the schedule building process if there is a conflict in the choosing of the next activity. The paper considers some nature-inspired algorithms such as the intelligent water drops algorithm, a genetic algorithm and ant colony optimization as well as a self-configuring version of the last two. The algorithm performance and different solution representation approaches are compared using the results of solving the test problems.
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/734/1/012107