An integrated flexible scheduling algorithm by determining machine dynamically

Abstract

Recently the existing integrated flexible scheduling algorithm of complex product processing and assembling which are processed simultaneously cannot make full use of the features that there is multiple machines and multiple utility time, and machines selection is not flexible to obtain the optimum scheduling results. Aiming at this problem, an integrated flexible scheduling algorithm of processing and assembling by determining machines dynamically which can advance the finishing time of procedures is presented. Analysis and examples show that this algorithm can realize the optimum result of the integrated flexible scheduling problem of complex products processing and assembling under the situation that the algorithm complexity is not improved. © 2012 Springer-Verlag GmbH.