ROBUST ALGORITHM FOR SCHEDULING OF MANUFACTURING TASKS WITH INTERVAL EXECUTION TIMES

In the paper the combined routing-scheduling problem, which consists in scheduling of tasks for moving executors, is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the makespan is investigated. The robust scheduling problem based on the relative regret is formulated. The solution algorithm of polynomial computational complexity, which uses simulated annealing approach, is presented. The results of simple numerical experiments are given.