Abstract
A routing-scheduling problem treated as a generalization of a traditional task scheduling problem is investigated in the paper. The generalization deals with the necessity to drive-up of executors, being the performers of tasks, to workstations where the tasks are carried out. An uncertain version of a simple problem with the makespan as the performance index is considered. It is assumed that execution times are not known a priori, but they are elements of given intervals. The uncertain decision-making problem is formulated with the performance index being the absolute regret based on the makespan. A heuristic solution algorithm, which uses a simulated annealing metaheurisics, is proposed. The property of the performance index is shown, which makes easier its calculations. Selected results of numerical experiments are given which evaluate the quality of the uncertain problem in terms of the absolute regret and the time of computation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.