Research On Distributed And Flexible Job-shop Scheduling Optimization Based On Combinatorial Auction

A distributed manufacturing system consists of many workshop in different places, theyaccomplish a mutual manufacturing task goals through the long-term or temporary cooperationwith a loosely or tightly relationship, thus it is more dynamic, uncertain and complex. It ismuch more difficult to solve the multi-objectives optimization problems than conventionalproduction scheduling. Therefore an effective scheduling mechanism is required that not onlyobtains the optimal or near optimal scheduling results, also responses to changes in themanufacturing process rapidly. In order to provide some useful reference and tools to optimizethe production process and improve the economic benefit of manufacturing enterprise, thispaper studies the distributed flexible workshop production scheduling problem based onalliance enterprise manufacturing mode.In order to solve the problem of production scheduling under dynamic environment, acontrol structure model of production system is designed and then puts forward a schedulingstrategy based on combinatorial auction and a optimization algorithm.A hybrid distributed and hierarchical control structure is proposed considering thefeatures of the alliance manufacturing model based on the analysis of distributed schedulingproblems. The hybrid structure mainly includes the task allocation and flexible scheduling.Based on the working principle of the control structure, task assignment problem and theproduction scheduling problem is studied, while focuses on analysis of task assignmentproblem. Paper applies combinatorial auction mechanism to the task allocation problem anddiscusses the auction mechanism in the process of task allocation in detail, then proposes thetask allocation model based on combinatorial auction mechanism. In order to further solve theproblem of production scheduling, A model of production scheduling is established based thecharacteristics of flexible workshop.In order to validate the feasibility of the proposed scheduling strategy based oncombinatorial auction mechanism, Ant colony optimization algorithm is designed for taskallocation and optimization scheduling problem fully using ant colony algorithm in solving theadvantages of discrete combination optimization problems.Finally, the paper verifies the research strategy based on the development environment of MATLAB R2010a, using the development language MATLAB. The simulation results notonly illustrate the validity of the algorithm, but also indicate a better scheduling result derivedfrom the proposed scheduling strategy for the distributed flexible workshop schedulingproblem.