Algorithm for capacity scheduling
Автор: Kazakovtsev L.A., Antamoshkin A.N.
Журнал: Вестник Красноярского государственного аграрного университета @vestnik-kgau
Рубрика: Управление и бизнес
Статья в выпуске: 4, 2015 года.
Бесплатный доступ
A problem of optimal capacity planning of the production lines with a continuous manufacturing cycle (foundry for example) in accordance with a given product launch plan is considered as a discrete location problem on a network. For solving the problem, we use genetic algorithm with greedy heuristics based on an analogous algorithm for the p-median problem.
Genetic algorithm, discrete location problem, operations scheduling, p-медианная задача, p-median problem
Короткий адрес: https://sciup.org/14084229
IDR: 14084229
Статья научная
