Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Scientific Workshop «MIP Engineering 2019: Advanced Technologies in Material Science, Mechanical and Automation Engineering»; Krasnoyarsk; Krasnoyarsk

Год издания: 2019

Аннотация: The paper considers a job shop scheduling problem similar to those taking place in many fields such as project management, educational sphere and operational planning of manufacturing process. The considered problem, in real life, has high dimensionality and it is quite hard to find even a feasible solution, therefore, making necessary a problem-oriented heuristic for solving it in reasonable time. Manufacturing process stability requires special care about restriction and, at the same time, operational planning requires finding solutions quickly. In this paper, hierarchical problem structure is proposed where the top-level problem is the traveling salesman problem and the nested resource-constrained project scheduling problem is replaced by the simulation model. This paper considers combinatorial genetic algorithm (GA) and Lin-Kernigan heuristic (LKH). The performance comparison is fulfilled and competitive results are demonstrated.

Журнал: IOP Conference Series: Materials Science and Engineering

Выпуск журнала: 537

Номера страниц: 32001

Издатель: Institute of Physics and IOP Publishing Limited

• Semenkina O E (Reshetnev Siberian State University of Science and Technology)
• Popov E A (Reshetnev Siberian State University of Science and Technology)
• Ryzhikov I S (Numerical modelling office, JSC "Krastsvetmet")

• Ядро РИНЦ (eLIBRARY.RU)