Branch and Bound Algorithm for the Order Optimization of Parallel Activities in Project Scheduling

In order to solve the problem of four parallel activities being adjusted to an order chain of three activities and a parallel activity in deterministic activity-on-arc networks of the CPM type, a new theorem and the comparative method of special order chains of three activities are proposed. Based on the theorem and method, a branch and bound algorithm of the decision tree is described. Through the example, the algorithm minimizes the computational effort in enumerating alternative modes.