Algorithm Synthesis of Controlling a Transport Unit of a Coextrusion Flexible Manufacturing Section for Processing Multicomponent Materials

Algorithm Synthesis of Controlling a Transport Unit of a Coextrusion Flexible Manufacturing Section for Processing Multicomponent Materials

Valery V. Dyadichev, Sergey S. Stoyanchenko, Roman L. Plomodyalo, Aleksandr V. Dyadichev

download PDF

Abstract. The paper offers a mathematical model of the process of coextrusion flexible manufacturing section functioning. On the basis of dynamic programming method an algorithm of controlling transport unit of coextrusion flexible manufacturing system is developed. The objective of the current research is the development of the mathematical model of the flexible manufacturing complex for processing multicomponent materials functioning process, and construction of the algorithm of controlling a transport unit of a coextrusion flexible manufacturing complex for processing multicomponent materials on this basis. The paper offers the criterion of evaluating the quality of controlling the transport unit. The chosen variant of controlling the transport unit has to meet many requirements. This paper con-siders the issues connected with the search for an optimum algorithm of control-ling a transport unit according to the set criterion. Most works offer analytical models which are based on the assumption of the current processes’ stability. Real manufacturing conditions are characterized by the effect of numerous perturbing factors. Under such conditions the assumption of the current processes’ stability makes the obtained models almost untrue.

Keywords
Algorithm, Mixture of Materials, Dosing Device, Multicomponent Materials, Synthesis, Coextrusion Manufacturing Section

Published online 1/5/2022, 6 pages
Copyright © 2022 by the author(s)
Published under license by Materials Research Forum LLC., Millersville PA, USA

Citation: Valery V. Dyadichev, Sergey S. Stoyanchenko, Roman L. Plomodyalo, Aleksandr V. Dyadichev, Algorithm Synthesis of Controlling a Transport Unit of a Coextrusion Flexible Manufacturing Section for Processing Multicomponent Materials, Materials Research Proceedings, Vol. 21, pp 298-303, 2022

DOI: https://doi.org/10.21741/9781644901755-53

The article was published as article 53 of the book Modern Trends in Manufacturing Technologies and Equipment

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

References
[1] B. Bauer, R.F. Bullnheimer, C. Hartl, Strauss. Minimizing total tardiness on a single machine using ant colony optimization, Proc. of the 1999 Congress on Evolutionary Computation (CEC99), Washington D.C., USA (1999) 1445–1450
[2] J. Blazewicz, et all, Handbook on Scheduling. From Theory to Practice, Springer Verlag (2019). https://doi.org/10.1007/978-3-319-99849-7
[3] O. Brucker, Scheduling Algorithms. Springer Verlag (2007)
[4] P. Brucker, S. Kravchenko, Scheduling Jobs With Release times on Parallel Machines to Minimize Total Tardiness. OSM Reihe P, Heft 258, Universit ̈at Osnabr ̈uck, Fachbereich Mathematik/ Informatik (2005)
[5] S. Chang, Q. Lu, G. Tang, W. Yu, On decomposition of total tardiness problem, Oper. Res. Lett. 17 (1995) 221-229. https://doi.org/10.1016/0167-6377(95)00027-H
[6] F. Della, A. Croce, V. Grosso, Paschos, lower bounds on the approximation ratios of leadingheuristics for the single-machine total tardiness problem, J. of Scheduling 7 (2004) 85-91. https://doi.org/10.1023/B:JOSH.0000013056.09936.fd
[7] A.P. Gavrish, B.M. Voronets, Robotized Machine Building Construction Complexes for Mechanical Processing (in Russian), Technika, Kyev (1984)
[8] E.N. Khobotov, Some models and solution methods for scheduling tasks in discrete manufacturing systems, A&T 12 (2007)85-100
[9] I.A. Klausov, I.S. Blyakherov, G.M Varyash, A.A. Ivanov, Automatic Loading of Technological Machines (in Russian), Reference book, Mashinostroyeniye, Moscow (1990)
[10] M.S. Kunyaev, A.M. Sidorenko, A.S. Firsov, E.N. Khobotov, Methods of schedule building in manufacturing systems, MSTU named after N.E. Bauman (2009)
[11] A. Lazarev, A. Kvaratskhelia, Tchernykh, Solution algorithms for the total tardiness scheduling problem on a single machine, Workshop Proc. of the ENC’04 Int. Conf. (2004) 474–480
[12] D. Merkle, M. Middendorf, An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problem, Evo Work Shops, LNCS 1803, Springer, Verlag (2000) 287–296. https://doi.org/10.1007/3-540-45561-2_28
[13] M.L. Pinedo, Planning and Scheduling in Manufacturing and Services, Springer Dordrecht Heidelberg ,London, New York (2009). https://doi.org/10.1007/978-1-4419-0910-7
[14] M.L. Pinedo, Scheduling. Theory, Algorithms, and Systems, Springer, Dordrecht Heidelberg London, New York (2008)
[15] K. Rikhter, Dynamic problems of discrete optimization (in Russian), Radio and communication, Moscow (1985)
[16] C. Schwindt, et al., Handbook on Project Management and Scheduling 1, Springer International Publishing, Berlin, Heidelberg, New York (2015). https://doi.org/10.1007/978-3-319-05443-8
[17] A.M. Sidorenko, E.N. Khobotob, An aggregation in scheduling on machine building enterprises, Control theory and systems 5 (2013) 132-144. https://doi.org/10.1134/S1064230713050110
[18] Z. Tian, C.T. Ng, T.C.E. Cheng, An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimze total tardiness, J. of Scheduling 9(4) (2006) 343–364. https://doi.org/10.1007/s10951-006-7039-6
[19] W. Szwarc, A. Grosso, F. Della Croce, Algorithmic paradoxes of the single machine totaltardiness problem, J. of Scheduling 4 (2001) 93-104. https://doi.org/10.1002/jos.69
[20] V.A. Yegorov, V.D. Lusanov, S.M. Scherbakov, Transporting Storing Systems. FMS (in Russian), Mashinostroyeniye, Leningrad (1989)