| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 712357 | IFAC Proceedings Volumes | 2007 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
