Algorithm for scheduling of tasks on moving executors with uncertain processing times

The problem of scheduling tasks on moving executors in complex operation system with application to discrete manufacturing systems is considered. The minimisation of makespan for unrelated executors and non-preemptive, independent tasks is investigated in detail. It is assumed that tasks are performed at stationary workstations by moving executors. The case with uncertain processing times is considered. The knowledge of the finite set of possible values for each processing time is assumed. The corresponding optimisation problem is formulated and solved using the algorithm based on the branch and bound approach.