Heuristic algorithms for solving uncertain routing-scheduling problem

Abstract

A combined routing-scheduling problem is considered in the paper. It consists in scheduling of tasks on moving executors. The case with non-preemptive and independent tasks, unrelated executors as well as interval execution times to minimize the makespan is investigated. The worst-case scheduling problem based on an absolute regret is formulated. Solution algorithms of polynomial computational complexity, which use simulated annealing as well as tabu search approaches, are presented. The results of numerical experiments are given. © 2008 Springer-Verlag Berlin Heidelberg.