Research On Parallel Integrated Scheduling Algorithm With Balanced Mechanism Of Multiple Workshops

The research of processing and assembling simultaneously schedulingoptimization problem can shorten the production cycle and bring greatereconomic benefits for enterprises.Due to the problem of closed and irreconcilable nature traditional singleintegrated production scheduling, many enterprises can’t stand out in thecompetition, so a new task that integrated distribution scheduling of product willbe processed in workshops located in different places is proposed.Aiming at integrated scheduling problem with two symmetrical workshop,tree leaf node of the product processing tree can be scheduled with unconstrainedproduction scheduling and non-preemptive processing equipment constraints， somultiple workshops batch scheduling mathematical model is based on themaximum period of completion with a batch process of the leaf nodes being asearly the next batch starting processing time, and integrated scheduling algorithmwith equalization processing in two symmetric workshops is proposed. Firstbatch processes leaf node is defined, second leaf nodes is grouped equallyaccording to the number of workshops, the optimum determination of groupingprocess workshop is by less mobile workshop conducted.Aiming at workshop equalization processing algorithms with many idle timeand poor coercion on the number of displacement, integrated schedulingalgorithm with the critical value of equalization in two symmetric workshops isproposed. Firstly, the leaf processing is end, where its optimum workshop aftertightening process can be determined based on finished processing steps toreduce the number of moving steps; workshop equipment is the same, oncondition that the moving is fewer, other processes adopt balanced arrangement according to the leaf node batch processing assigned to workshop. Proceduresassigned to workshops adopt long path and other strategies to determine thescheduling order, ordered collection determine the starting time based on theproduct process constraints. The algorithm is a priority under the case number ofmoving to achieve a balanced process of controlling a mobile workshop strongerthan balancing algorithm, and solve low equipment utilization that the batch leadto by the workshop balancing algorithm.Aiming at the problem of products processing in the asymmetric threeworkshops, processes processing on asymmetric device will be inevitablyproduce displacement, so integrated scheduling algorithm of partial equilibrium processing with the unit shipping time is put forward. The algorithm t-akes constraints between successor and predecessor of the critical value ofequalization algorithm into account to determine optimal workshop of processes, and unforeseen process is determined workshop by balanced experimental design. The complexity of the proposed algorithm is not beyond the quadratic polynomial to solve the asymmetric three workshop scheduling problem.