The integrated flexible scheduling algorithm of complex product with no-wait constraint between procedures

Aiming at the integrated flexible scheduling problem that complex products with No-Wait constraint conditions between procedures, an algorithm which combines the procedures with No-Wait constraint conditions and its predecessor into a virtual node set is proposed. For standard flexible procedures, the allied critical path method is taken to confirm the scheduling order and the adaptive flexible scheduling strategy is taken to processing the procedure. For flexible procedures with No-Wait constraint conditions, the shortest processing time scheduling strategy is used. To obtain the better flexible scheduling procedure structures, the expanded flexible processing tree and virtual flexible processing tree are also proposed. Example shows that this algorithm can solve the problem in practical significance, and easy to implement.