A Dial-a-Ride evaluation for solving the job-shop with routing considerations

The present work investigates a new evaluation function for the JSPT which integrates routing problematic to compute non semi-active solutions but which minimize the makespan first and maximize the Quality of Service second thanks to a time-lag max based modeling and an iterative process. The Quality of Service proposed in this paper, is extended from the Quality of Service defined by (Cordeau and Laporte, 2003) for the DARP. The procedure performance is benchmarked with a CPLEX resolution and the numerical experiments proved that the proposed evaluation function is nearly optimal and provides new solutions with a high Quality of Service.