The fuzzy job shop scheduling problem with makespan minimization is revised.We survey existing metaheuristic methods and test beds for the problem.More challenging benchmark instances with LBs and competitive results are proposed.We publish old and new test beds to facilitate reproducibility and future research. The fuzzy job shop scheduling problem with makespan minimisation is a problem with a significant presence in the scientific literature. However, a common meaningful comparison base is missing for such problem. This work intends to fill the gap in this domain by reviewing existing benchmarks as well as proposing new benchmark problems. First, we shall survey the existing test beds for the fuzzy job shop, analysing whether they are sufficiently varied and, most importantly, whether there is room for improvement on these instances - an essential requirement if the instances are to be useful for the scientific community in order to compare and develop new solving strategies. In the light of this analysis, we shall propose a new family of more challenging benchmark problems and provide lower bounds for the expected makespan of each instance as well as reference makespan values obtained with a memetic algorithm from the literature. The resulting benchmark will be made available so as to facilitate experiment reproducibility and encourage research competition.
['Juan José Palacios', 'Jorge Puente', 'Camino R. Vela', 'Inés González-Rodríguez']
Benchmarks for fuzzy job shop problems