Research On Integrated Scheduling Algorithm Of Multiple-workshops Based On The Principle Of Using The Migration Time

Traditional workshop production research is mainly study on environment of single workshop which without considering the interaction between workshops. However, in actual industrial production, there exists the environment of various processing resources in different workshops. Integrated scheduling focus on the key points:how to allocate resources of multi-devices, how to arrange the migration between the process of workshops, the influence of migration on completion time, if the migration can be avoided or not, the time of migration whether can use, and so on.For the problem that the process migration time influence the processing time of integrated scheduling, the algorithm is proposed which using the migration time based on device-driven between two workshops. In order to reduce the idle waiting time of equipment effectively, the strategy of idle driven for equipment is put forward, which looking for the suit process as long as the machine is idle, and scheduling processes by the long path and short using time strategy. In order to reduce the migration time taking the equipment processing time, the strategy is proposed that make the equipment effective use migration time. Examples show that the algorithm can make full use of spare time to improve equipment utilization, and effectively using the migration time for the purpose that completed as soon as possible, and the algorithm complexity is not higher than quadratic polynomial.For the issues of process migration between multi-workshops, in order to solve the problem that migration time affect the processing of integrated scheduling, the algorithm is proposed which using the migration time between multi-workshops. In order to solve the problem of multi-workshops selection under the complex environment, the strategy is put forward which reasonable arrange workshop select according to the properties of processes and the relevance between tight-before-process and tight-after-process. To reduce the delay time caused by migration, the strategy is put forward which migrates the process in the time of release to processing workshops. To take advantage of the migration waiting time, the strategy of using migration time is proposed, which schedule the idle process in waiting time that caused by migration. Examples show that the algorithm can make full use of spare time to improve equipment utilization, and effectively using the migration time. Examples show that the algorithm can make full use of spare time to improve equipment utilization, effectively using the migration time for the purpose of completion as soon as possible, and the algorithm complexity is not higher than quadratic polynomial.