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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.