Application Study Of Line-up Competition Algorithm In Chemical Production Scheduling

Production scheduling is the core content and the key technology of enterprises production management. A good scheduling program can distribute tasks and resources reasonably, reduce the production costs, and improve the production operation efficiency and the rapidly response capability of enterprises, accordingly enhance the competitiveness of enterprises. Therefore, study on the production scheduling problems, providing scientific and efficient production scheduling programs for enterprises, is of great practical value.This paper analyzed several typical scheduling problems in chemical production, and the main research content is as follows:Present the main characteristics of chemical production, and discussed the basic and the difficult scheduling problems existed in chemical production process. Several classic and modern optimization methods for production scheduling problems were summarized in this paper.The production scheduling problem of sequential multi-purpose chemical plant with zero-wait (ZW) policy was studied. For the optimal scheduling model with objective function of makespan, this paper present a heuristic "separate-constrict" strategy to simplify the calculation of the makespan in a certain production sequence. Using Line-up Competition Algorithm (LCA) to optimize the production sequence, simultaneously, a proper mutation strategy was proposed to improve the rate of convergence.The boiler steam system cyclic scheduling problem was investigated. Proposed a sub-time strategy for this scheduling problem, and established a mixed-integer nonlinear program (MINLP) model based on the proposed strategy. LCA was adopted to solve the MINLP problem, and a case of boiler steam system cycle scheduling problem was studied. The results showed that cycle scheduling optimization can achieve remarkable energy saving effect.The fermentation process with air supply constraint, a kind of resource constraints, was analyzed. An optimal scheduling model, which had resource constraints and adopted makespan as objective function, was built. Applied LCA to solve the scheduling problem of a biological pesticide plant, and obtained an optimal scheduling program. The study of this problem is an important reference to the solution of resource-constraint scheduling problems.