Abstract
In the paper the combined routing-scheduling problem which consists in scheduling of tasks on moving executors is considered. The case with non-preemptive and independent tasks, unrelated executors as well as interval processing times to minimize the maximum lateness is investigated. The robust scheduling problem based on the modified relative regret function is formulated. The solution algorithm uses the result which allows to reduce an uncertain problem to a number of deterministic problems. Then the uncertain problem considered can be solved by a deterministic algorithm. The simple numerical example is given.
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 callDisclaimer: 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.
