Abstract:
The problem of the theory of schedules with an additional condition – the need to choose an alternative chain of operations in the technical processes of products is considered. A two-stage planning algorithm is proposed, the first stage of which is the selection of chains of operations suitable for a certain criterion from the given alterna-tives, after which the task is reduced to the classic JSSP (Job-Shop Scheduling Problem) problem. At the second stage, the selected production operations are arranged on the machines, taking into account the order of the technological process and other restrictions. Minimization of changeover time in production was chosen as an optimization criterion. The description of the algorithm and its implementation is given on the example of the cable industry (production of wiring harnesses). Both stages of planning are implemented on the basis of greedy algorithms, the results of test measurements on various amounts of data (up to tens of thousands of operations) are presented. The implementation is made in C# 10 using a free platform .NET 6. The vector of further research is the implementation of more complex algorithms (in particular, based on evolutionary methods) in order to obtain more optimal plans.
Keywords:scheduling problems, minimization of setup times, scheduling theory, greedy algorithms.
Fulltext:
PDF file (400 kB)