UN SYSTEME DE VOISINAGE EFFICACE POUR LE PROBLEME DU JOB-SHOP AVEC TRANSPORT

This paper is devoted to the study of an extension of the job-shop, in which transport of the parts between the machines is taken into account. The objective is then to simultaneously schedule the machines and the vehicles, in order to minimize the makespan. Both problems are known to be NP-hard. To deal with this problem, we propose a new representation of the solutions space, and an efficient neighbouring system. Three different metaheuristics (iterated local search, simulated annealing and their hybridization) have been implemented. The results obtained are better than those in the literature, and this independently from the method used. New upper bounds are proposed for 11 of the 40 instances which compose our benchmark test.