Scheduling tasks on moving executors to minimise the maximum lateness

The problem of scheduling tasks on moving executors in complex operation systems with application to discrete manufacturing systems is considered. The minimisation of maximum lateness for unrelated executors and nonpreemptive, independent tasks is investigated in detail. It is assumed that tasks are performed at the stationary workstations by moving executors. This leads to a new optimisation problem, which is solved using the method based on the decomposition of the problem. The approximate solution method using known solution algorithms for the scheduling tasks and travelling salesman problems is presented. The considerations are completed with a numerical example which illustrates the main topics of the considerations.