Rescheduling based on branch-and-bound in critical chain project scheduling

There are some resource conflicts and precedence conflicts that might be happened after inserting feeding buffer in the critical chain scheduling/buffer management.These conflicts could be solved by using the branch-and-bound rescheduling algorithms which included both global and local rescheduling.Finally,it designed some simulations to evaluate the impact of three different levels of activity uncertainty on the project completion rate and stability cost.The computational results indicate that the critical chain rescheduling based on global branch and bound which keeps the original critical chain is the best among all.Besides,the lower the uncertainty,the higher the timely completion probability and the lower the stability cost.