Minimization of Production Cycle for the Technological Cell with Several Robots
Abstract
The task considered in this article for the first time has been set and solved for the case with several industrial robots serving all machines at one technological operation. Such a generalization in most cases is necessary for production program satisfiability in the planning period. The problem is turned into a standard “stone heap task” for which decision an effective algorithm is known.
Keywords:
cycle minimization, robot complex, “the stone heap task”, schedule chart, multiplemachine service (operation)
Downloads
References
References in Latin Alphabet
Translation of references in Russian into English
Downloads
Published
How to Cite
Issue
Section
License
Articles of the St Petersburg University Journal of Economic Studies are open access distributed under the terms of the License Agreement with Saint Petersburg State University, which permits to the authors unrestricted distribution and self-archiving free of charge.