An Improved Shifting Bottleneck Algorithm for Job Shop Scheduling Problem

edu. cn The shifting bottleneck procedures are mainly b a e d on one-machine scheduling algorithm, so the resuh of one-machine scheduling algorithm significantly deet the perJormamce of the shiping bottleneck procedures. In this paper, inspired by two facts that the firnction of ihe reienre time and the delivery time of each job is uniform, an eficient algorithm for one-machine scheduling problem is presented. Based on this algorithm, an improved shifting bottleneck procedure is developed The simulation results to the well-known benchmark problems show that the performance of ihe improved procedure can compete with that of the skvting bottleneck procedure and the modified ones