| Author(s) | Collection number | Pages | Download abstract | Download full text |
|---|---|---|---|---|
| Kulchytska Kh. B. | № 1 (62) | 87-94 |
|
|
In the rapid development of information technology, modern publishing and printing companies must constantly be advancing. Some forms of such advances include technical re-equipment or reconstruction, which increases the volume and accelerates the production, improves the quality and working conditions. One of the most challenging tasks of technological advancement is the distribution of equipment between printing divisions. Each division of the enterprise is interested in obtaining new equipment units and increasing the volume of work. However, it is necessary to take into account the underlying costs because the technical characteristics of the equipment are the same, and so is the performance.
This paper investigates the dependence of transportation and maintenance costs on the amount of equipment provided to different divisions of the printing enterprise.
The method of recurrent relations was used to solve the problem of distribution of equipment between prepress sections of the printing company. The recurrent method made finding the required minimum costs easier by using a smaller number of variables. This task was considered to be a dynamic process despite the lack of temporal data. Therefore, dynamic programming based on the Bellman functional equation was used to solve it. The problem of optimal distribution of equipment between sections was solved using a forward dynamic programming algorithm, dividing a complex task into simple tasks (steps). The number of steps was equal to the number of divisions to which the equipment was distributed, so conditional and unconditional optimizations were multi-step.
As a result, the optimal number of equipment units for each division was determined, ensuring the minimum total costs for its transportation and maintenance during the technical re-equipment of divisions.
Keywords: printing, equipment distribution, Bellman principle of optimality, recurrent relations.
doi: 10.32403/1998-6912-2021-1-62-87-94
- 1. Akulich, I. L. (2011). Matematicheskoe programmirovanie v primerah i zadachah. 3-e izd. Sankt-Peterburg : Lan’ (in Russian).
- 2. Bellman, R. (1965). Prikladnye zadachi dinamicheskogo programmirovanija. Moskva : Inostrannaja literatura (in Russian).
- 3. Shumeiko, O. A. (2012). Dynamichna model optymalnoho rozpodilu investytsii pry zaminy obladnannia: Ekonomiko-matematychne modeliuvannia sotsialno-ekonomichnykh system : zb. nauk. prats MNNTs ITiS. Kyiv, 17, 255–267 (in Ukrainian).
- 4. Bilichenko, V. V., & Kuzhel, V. P. (2017). Modeliuvannia tekhnolohichnykh protsesiv pidpryiemstv avtomobilnoho transportu. Vinnytsia : VNTU (in Ukrainian).
- 5. Marko, M. Ya., & Tsehelyk, H. H. (2016). Zadacha rozpodilu resursiv mizh pidpryiemstvamy firmy, shcho zabezpechuie maksymalne zbilshennia vypusku produktsii: Visnyk Lvivskoi komertsiinoi akademii. Seriia ekonomichna, 50, 153–156 (in Ukrainian).
- 6. Solodovnyk, H. V. (2016). Determinovana model optymalnoho rozpodilu resursiv: Molodyi vchenyi, 6, 108–111 (in Ukrainian).
- 7. Bilotserkivskyi, O. B. (2018). Matematychne modeliuvannia v ekonomitsi ta menedzhmenti. Kharkiv : NTU KhPI (in Ukrainian).
- 8. Honcharenko, Ya. V. (2010). Matematychne prohramuvannia. Kyiv : NPU imeni M. P. Drahomanova (in Ukrainian).
- 9. Yefymova, H. O., & Rudyk, O. H. (2008). Liniini bahatokryterialni zadachi vyrobnychoho planuvannia: Visnyk sotsialno-ekonomichnykh doslidzhen, 31, 102 (in Ukrainian).
- 10. Lavrov, Ye. A., Perkhun, L. P., & Shendryk, V. V. ta in. (2017). Matematychni metody doslidzhennia operatsii. Sumskyi derzhavnyi universytet (in Ukrainian).