Abstract
The paper deals with the scheduling problem relevant in many fields, such as project management, lesson scheduling or production scheduling. In practice, using optimisation methods to solve the scheduling problem is considerably restricted by the fact that in the real world, problem statement involves high dimensionality, high production process complexity and many nontrivial constraints. These specifics mean that even merely searching for a feasible solution becomes a difficult task. Consequently, in order to solve the problem in a reasonable amount of time it is necessary to use problem-oriented heuristics. Ensuring manufacturing process stability involves respecting all constraints, but at the same time, short-term production planning demands fast solutions whenever there is a change of state. We propose to implement a hierarchical problem structure that puts the travelling salesman problem at the top and replaces the nested resource-constrained project scheduling problem with a simulation model. The paper considers using such algorithms as the Lin --- Kernighan heuristic, the genetic algorithm and the ant colony optimization. We study the efficiency of employing the algorithms mentioned above to solve the scheduling problem in the statement proposed.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call