Abstract
This paper describes the construction of an optimal schedule for a metallurgical workshop using discrete programming, and in particular, the method of branches and boundaries. In this regard, a heuristic approach to solving this problem is proposed, which includes: building an initial graph that satisfies the constraints of the optimization problem, as well as sequential search optimization of the initial graph according to a given criterion. To test the effectiveness of using the task of forming a melting schedule as part of the operational control subsystem in the converter department, experimental studies were conducted. Considering that the creation of the automated process control system of the copper plant provides for the introduction of systems using modern software and hardware controls, cargo flow control, and an automated conversion process control system, the efficiency of using optimal melting schedules will significantly increase.