The neutrosophic earliest and latest start time as well as neutrosophic earliest and latest finish time
of each activity for finding neutrosophic critical path of a project are derived by using forward pass and backward pass calculations as follows:
For each PM/VM (lines 1-3), the algorithm examines whether the finish time of the task with latest finish time
(lines 8-10) could be reduced by reassigning the task to the core with the lightest load (lines 11-12) on a PM/VM, and, if so, reassigns the task to the core (lines 13-20).
Each activity has an earliest start time and a latest finish time
on the critical chain, and free resources are shifted to start projects earlier or speed them up as needed.
Hills - what will be the Centre Court's latest finish time