Abstract: The current integrated scheduling algorithms just consider how to realize scheduling plan by inserting set-up time quickly, but not consider the problem that the total set-up time will change along with the changing of scheduling order of procedures, which can influence the scheduling result. Aiming at this problem, integrated scheduling algorithm of shortening total set-up time by changing the scheduling order of procedures is proposed. This algorithm is under the pre-condition of not moving immediately successor procedures backward, reduces the ratio of set-up time in total working hours by changing the scheduling order of procedures with same priority level partly on same machine, and improves the machine utilization efficiency. Example shows this algorithm can obtain the better result of integrated scheduling problem with set-up time in secondary time complexity.

Key words: Integrated scheduling, Machine utilization efficiency, Scheduling algorithm, Scheduling order of procedures, Set-up time