A Classification Schema for the Job Shop Scheduling Problem with Transportation Resources: State of the Art Review
The Job Shop scheduling Problem (JSP) is one of the most known problems in the domain of the production task scheduling. The Job Shop scheduling Problem with Transportation resources (JSPT) is a generalization of the classical JSP consisting of two sub problems: the job scheduling problem and the generic vehicle scheduling problem. In this paper, we make a state of the art review of the different works proposed for the JSPT, where we present a new classification schema according to seven criteria such as the transportation resource number, the transportation resource type, the job complexity, the routing flexibility, the recirculation constraint, the optimization criteria and the implemented approaches.
CSOC