Comparison between two approaches to solve the Job-shop Scheduling Problem with Routing
Résumé
This paper is a comparison between two approaches using the TLH evaluation, the first approach is an integrated approach permitting to find high quality solutions in terms of makespan but requiring high computational time. The second approach is a sequential approach in which the TLH evaluation is performed only on the best solution according to the makespan criteria, the TLH evaluation included in a sequential approach permits to obtain a solution maximizing the QoS with a low computational time.