A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Communications in Computer and Information Science
In this paper we tackle a variant of the job shop scheduling problem where task durations are uncertain and only an interval of possible values for each task duration is known. We propose a genetic algorithm to minimise the schedule's makespan that takes into account the problem's uncertainty during the search process. The behaviour of the algorithm is experimentally evaluated and compared with other stateof-the-art algorithms. Further analysis in terms of solution robustness proves thedoi:10.1007/978-3-030-50143-3_52 fatcat:wa7pijw3gfg6lme5b5gwg4pdde