Abstract: Aiming at the problem that parallel processing among the groups of operations and machines with plenty of idle time will be caused by allied critical path method (ACPM) based on the length of path by the integrated scheduling algorithm, an integrated scheduling algorithm based on event-driven by machines’ idle is presented. Selecting operations which need be processed according to the idle machines is the main method in this algorithm. Process of this method is to regard the end of each operation processed as an event with machines’ idle, and this event drives idle machine to search schedulable operations. If schedulable operation is sole, this operation is scheduled. If schedulable operations are not sole, the operation whose father node has longest path length is selected. If the operations with longest path of father node are not sole, operation whose processing time is shortest is selected. As this algorithm doesn’t consider the operation sequence in scheduling operations and it is driven by machines’ idle, the algorithm can cause among schedulable, take full advantage of idle time of machine and avoid problem that there will be more machine idle time by using the integrated scheduling algorithm based on ACPM. In addition, the algorithm needn’t to compare the length of machine idle time and judge whether using identical machines is balanced, and also not need idle machine to detect schedulable operations frequently, so plenty of judgment operations can be saved. Examples show the algorithm which is proposed not only has the highest efficiency than other algorithms based on ACPM, but also can be realized easily.

Key words: Event-driven, Integrated scheduling, Machines’ idle event, Operations parallel processing, Scheduling algorithm