A Dial-a-Ride evaluation for solving the Job-shop Problem with Transport
Résumé
The Job-Shop scheduling Problem with Transport (JSPT) is a combinatorial optimization scheduling
problem which has received attention for decades, resulting in numerous publications focusing in the
makespan minimization. However, no previous study exists where the transport part of the problem
is considered into the objective function using classical approaches taken from the routing
community. The present work investigates the integration of the routing and the scheduling,
considering simultaneously the makespan minimization and the Quality of Service maximization.
The Quality of Service is defined by the flow time (total duration of the trips), the total riding time
and the total waiting time.