Research On Integrated Scheduling Algorithm Of Multiple-workshops Based On The Principle Of The Neighborhood Rendering

Traditional integrated scheduling is mainly study on single workshop, butthe more workshops scheduling problem is much closer to the actual production.This involves two problems: one is how to use the same equipment resources;another is the number of processing migration between workshops.Aiming at that the problem that how to allocate complex product procedureseffectively to two workshops with the same equipment resources, the integratedscheduling algorithm of two workshops based on neighborhood rendering isproposed. In order to let two workshops products completed as soon as possible,this algorithm proposes critical-equipment equilibrium strategy, prior allocatedprocedures of key-equipment balanced to two workshops in accordance with thelongest parallel processing scheme. In order to reduce the number of procedurestransfer between two workshops, put forward the strategy based on Neighborhoodrendering and the strategy to select workshop for the same equipment procedure.By calculating the rendering factor and the influence factor of the neighborhoodprocedure, to determine other unallocated processing workshop. In order toimprove the scheduling efficiency, adopts the strategy of dynamic critical pathand short-time strategy to determine the scheduling sequence, then makes surethe processing workshops and start time. Analysis and instance show that theimplementation of algorithm achieve the product in the shorter processing timeand the less procedures migration times and do not increase the algorithmcomplexity.Aiming at the actual assembly production in more workshops withasymmetric resources, the integrated scheduling algorithm based on theneighborhood rendering strategy is proposed. The algorithm analyses the special distribution of more workshops, which puts forward the strategy of specialprocess rendering, solving the process arrangement problem in the condition ofasymmetric resources. Through the special process to determine rendering range,the strategy effectively reduces the unnecessary migrations between workingprocedure in the workshops. And according to the distribution of other repeatedequipment processes, the strategy of render competition strategy and thecompetitive strategy of the same equipments is proposed. The algorithm makessure the processing to complete as early as possible. Analysis and instance showthat the implementation of algorithm achieve the scheduling in more workshopswith the shorter processing time and the less procedures migration times, then donot increase the algorithm complexity.