An Algorithm of Simple Multi-Product Scheduling Problem with No-Wait Constraint between Operations
Considering the simple multi-product scheduling problem that there is no-wait constraint between operations, an algorithm is presented which combines the ACPM (allied critical path method) and BFSM (best fit scheduling method) scheduling algorithm. In this algorithm the operations with no-wait constraint and finish-to-start constraint can be converted into a virtual operation. So the scheduling problem with no-wait constraint can be converted into the scheduling problem without no-wait constraint operations but with virtual operations. Then the movement and adjustment algorithm is adopted to sequence the operations which are converted into virtual operation on corresponding machines. So the problem with no-wait constraint between operations can be resolved. Example shows that the method with virtual operations and the movement and adjustment algorithm presented by this paper can be easy to realize, and favorable results can be obtained.
Xie Yi and Li Mi
Z. Q. Xie et al., "An Algorithm of Simple Multi-Product Scheduling Problem with No-Wait Constraint between Operations", Advanced Materials Research, Vols. 129-131, pp. 902-907, 2010