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

摘要

The Job-Shop scheduling Problem with Transport (JSPT) is a combinatorial optimization problem that combines both scheduling and routing problems. It has received attention for decades, resulting in numerous publications focused on the makespan minimization. The JSPT is commonly modeled by a disjunctive graph that encompasses both machine-operations and transport-operations. The transport-operations define a sub-problem which is close to the DARP where pickup and delivery operations have to be scheduled. The vast majority of the evaluation functions used into disjunctive graphs of JSPT, minimizes the makespan and there is no routing criteria in the objective function. Commonly used evaluation functions lead to left-shifted solutions for both machine-operations and transport-operations.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.