Integrated combinatorial method for scheduling workplaces of primary manufacturing systems

Economics and management


Аuthors

Kobko L. I.

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

e-mail: k506mai.ru

Abstract

This work concerns the actual problem of applying mathematical methods in manufacturing process control. We examine the problem of optimal workplace scheduling that lies at the core of operative control systems for flow-line and batch production. At present, heuristic methods are applied for practical solution of this problem since, due to a number of its features, precision methods degenerate into the exhaustive search of variants. In this work a new method for the solution of the problem has been proposed. It is a hybrid computing procedure that applies, in order to accelerate the convergence of exact branch and bound method, the technique of searching the local-optimum solution of combinatorial problems at definite steps of the branch and bound algorithm.


Download

mai.ru — informational site MAI

Copyright © 2000-2021 by MAI

Вход