Research on Electrolytic Aluminum Pot Tending Machine Scheduling Based on Improved Greedy Algorithm

Abstract

A scheduling method based on an improved greedy algorithm is proposed, and it aims to improve the working efficiency of the pot tending machine (PTM) in the aluminum electrolysis production process. First, the PTM temporary scheduling tasks are screened out by considering the constraints and the production process, in the situation of meet the actual production needs. Second, use the shortest time slice as the time benchmark for the greedy algorithm through analysis tasks. Third, an improved greedy algorithm- the depth-first search algorithm is combined with the greedy algorithm is proposed, it not only improves the efficiency of PTM allocation and scheduling, but also solves the problem of repeated search in the traditional algorithm. Finally, simulation verification the proposed scheduling algorithm.