Font Size: a A A

Application Of Improved CPSO Algorithm In Electronic Product Scheduling

Posted on:2016-12-05Degree:MasterType:Thesis
Country:ChinaCandidate:Y SongFull Text:PDF
GTID:2322330482467645Subject:Measuring and Testing Technology and Instruments
Abstract/Summary:PDF Full Text Request
Production scheduling is not only a class of combinatorial optimization problems which has been widely studied, but also a typical NP-hard problem. The total completion time (Makespan) is one of the most important specifications in production scheduling problem and how to shorten the total completion time is the fundamental goal of the production scheduling problem.By analyzing production process of an electronic manufacturing enterprise, we can come up with the conclusion that the enterprise executes the batch processing under the hybrid flow workshop scheduling.With the production quotas provided by the enterprise we can get the processing time for each manufacture step and multiply it with the number of products,so we can get the product processing time matrix.In this paper, we regard the minimum total completion time as the optimization target, and the corresponding simplified conditions and constraints of the optimization target have been given. A production plant scheduling optimization model has been established and the improved chaos particle swarm (CPSO) algorithm combined with real coding method has been utilized to solve the model. We eventually get the feasible solutions satisfying the constraints.This paper introduces a perturbation superimposed Tent Logistic Operators in improved algorithm, making the algorithm can start the optimum chaos search process immediately in the iterative process once it falls into the local optima iterative loops. The algorithm uses a uniform distribution operator to randomly update the particle position vector which represents the processing sequence vector to ensure the diversity of the population to be as much as possible, in order to avoid "premature".Through the standard benchmarks we come up with conclusions as followed:1.The improved algorithm which has been proposed has obvious improvements in accuracy and efficiency when handling large-scale data.2. Almost no difference exists between the two algorithms when dealing with small-scale data.In the ERP system of an topical enterprise, a new type of production scheduling system is constructed. The over-all architecture, database structure and development process of the production scheduling system are discussed in detail in this paper. At present, the system has been successfully applied in the electronic manufacturing enterprises, the reasonable scheduling of the production orders is realized, and the automation level of the enterprise scheduling decision is improved. It can be concluded that the scheduling scheme proposed in this paper is feasible and it possesses practical significance and application prospects.
Keywords/Search Tags:Production Scheduling, Chaos Operator, PSO Algorithm, Optimization
PDF Full Text Request
Related items