350 rub
Journal Dynamics of Complex Systems - XXI century №5 for 2013 г.
Article in number:
Algorithms for optimization of planning system for discrete technological processes
Authors:
V. E. Bolnokin - Dr.Sc. (Eng.), Professor, The federal state unitary enterprise Research and experimental institute of automobile electronics and an electric equipment. E-mail: vitalybolnokin@yandex.ru, d.i.mutin@mail.ru
N. A. Volodina - Dr.Sc. (Eng.), Professor, The federal state unitary enterprise Research and experimental institute of automobile electronics and an electric equipment
V. A. Moiseev - Dr.Sc. (Eng.), Professor, General Director, The federal state unitary enterprise Research and experimental institute of automobile electronics and an electric equipment. E-mail: info@compomash-tek.ru
D. I. Mutin - Ph.D. (Eng.), Institute mashinovedenia the Russian Academy of Sciences. E-mail: d.i.mutin@mail.ru
Nguyen Quang Hieu - Post-graduate Student, National transport University of Hochiminh city, Vietnam. E-mail: baolong135@gmail.com
Abstract:
The article presents the results of solution to one of the most important problems in the theory and practice of planning the production process - the development of new control algorithms, allowing to provide minimizing the time spent on processing equipment changeovers. Fundamental factor in improving the efficiency of the technological complex of modern manufacturing systems is to solve the problems of planning (long and short term, rescheduling) and operational management. Planning of technological equipment that minimizes the total time changeovers, is a significant reserve increase performance of production systems, primarily by reducing downtime. Currently there is no sufficiently effective mathematical tool for solving this problem, in particular in the literature on the theory of scheduling optimization changeovers developed enough. Algorithm described in this article is a simple and effective means of solving the problem of minimizing the time changeovers. It can be used for solving scheduling problems in production for various purposes. It is most expedient to use in cases where the time spent on changeovers significantly.
Pages: 51-55
References

  1. Tanaev V.S. Gordon V.S., Shafranskij Ja.M. Teoriya raspisanij. Odnostadijny'e sistemy'. M.: Nauka. 1984. 384 s.
  2. Majnika E'. Algoritm optimizaczii na setyax i grafax. M.: Mir.1981. 318 s.
  3. Issledovanie operaczij. T. 1, 2. M.: Mir. 1981.
  4. Bolnokin V.E., Xo D. Lok. Adaptivnoe upravlenie na baze nechetkix regulyatorov i nejrosetevoj texnologii. Voronezh: Nauch. kniga. 2012, 280 s.