Process optimization algorithm for forming the production schedule of custom production enterprises

This article deals with the problem of downtime in production enterprises with time-based wages. Irrational allocation of resources leads to losses. This problem can be solved through the automation of production schedule process formation. In the presented paper, the authors use the terminology of schedule theory. As a research result, an algorithm that is a solution to the problem was developed. The algorithm assumes a random selection of an operation based on the criteria; the resource availability in a given time period is checked and then assigned to the appropriate operation. The algorithm is executed cyclically until all operations or resources are involved for a given time period. The construction of the algorithm is based on a calculated record, the excess of which leads to the termination of algorithm implementation and its re-launch. The described algorithm, after the expiration of the number of iterations specified by the user, visualizes the solution through the Gantt chart to ensure dispatching of production processes. The results obtained by the authors will make it possible to form a system for the intelligent formation of a production schedule and introduce it into the existing management system of a manufacturing enterprise engaged in the production of products from polymer composite materials.

1. Lazarev A.A., Gafarov E.R. Theory of schedules. Tasks and algorithms. Moscow, Drofa; 2011. 144 p. (In Russ.).

2. Anichkin A.S., Semenov V.A. An object-oriented framework for software implementation of schedule theory applications. Trudy Instituta sistemnogo programmirovaniya RAN = Proceedings of the Institute for System Programming of the RAS. 2017;29(3):247–296. (In Russ.).

3. Akho A., Khopkroft Dzh., Ul'man Dzh. Data structures and algorithms. Moscow, Izdatel'skii dom “Vil'yams”; 2000. 384 p. (In Russ.).

4. Stastny J., Skorpil V., Balogh Z., Klein R. Job shop scheduling problem optimization by means of graph-based algorithm. Applied Sciences. 2021;11(4). Available from: https://www.mdpi.com/2076-3417/11/4/1921/xml. DOI: 10.3390/app11041921 (accessed on 07.12.2022).

5. Sirkin T.V., Chernyshova A.P., Martynov P.A., Morozov A. D. Development of an automated system for compiling and optimizing the schedule of classes. Molodoi uchenyi = Young Scientist. 2020;317(27):65–71. (In Russ.).

6. Zang Z., Wang W., Song Y., Lu L., Li W., Wang Y., Zhao Y. Hybrid deep neural network scheduler for job-shop problem based on convolution two-dimensional transformation. Computational Intelligence and Neuroscience. 2019;2019:1–19. Available from: https://www.hindawi.com/journals/cin/2019/7172842/. DOI: 10.1155/2019/7172842 (accessed on 07.12.2022).

7. Bex P. Implementing a process scheduler using neural network technology. Extended abstract of masters’s thesis. Netherlands; 2008. 65 p. Available from: https://theses.ubn.ru.nl/handle/123456789/168 (accessed on 11.12.2022).

8. Samira C. Monte Carlo tree search for job shop scheduling problems. Extended abstract of masters’s thesis. Austria; 2017. 90 p. Available from: https://pure.unileoben.ac.at/portal/files/2220344/AC14530216n01.pdf (accessed on: 11.12.2022).

9. Geirsson E. Rollout algorithms for job-shop scheduling. Iceland, University of Iceland; 2012. 53 p. Available from: https://skemman.is/bitstream/1946/11956/ 1/Einar_Geirsson_ritgerd.pdf (accessed on 13.12.2022).

10. Lenstra J.K., Shmoys D.B., Tardos E. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming. 1987;46(1–3):217–224. Available from: https://www.researchgate.net/publication/4355176_Approximation_Algorithms_for_Scheduling_Unrelated_Paralle_Machines. DOI: 10.1109/SFCS.1987.8 (accessed on 13.12.2022).

11. Kolesov N.V., Tolmacheva M.V. Scheduling of problem solving in pipeline computing systems. Informatsionno-upravlyayushchie sistemy = Information and Control Systems. 2005;(5):16–21. (In Russ.).