Integrated scheduling algorithm based on dynamic essential short path

Abstract

In appearance, the total processing time of procedures on the longest path of the product processing tree is the lower bound of product completion time. In fact, essential paths which have great effects on scheduling result are formed due to serial processing of procedures on the same device. In order to reveal applications of essential path and avoid the occurrence of delaying in product processing as result of longer essential path being formed, an integrated scheduling algorithm based on dynamic essential short path has been proposed. Example validates the proposed algorithm can shorten the length of essential path formed by scheduling algorithm of long-path strategy and makes the product processing time less without increasing algorithm's time complexity. © 2012 Springer-Verlag GmbH.