This thesis addresses the problem of a simultaneous scheduling of machines and transporters in a job shop manufacturing system with the objective of minimizing the total tardiness. The problem analyzed is related to a real case: Loro Piana finishing department. The problem is formulated as a mixed integer linear programming model. The mathematical model of the problem is a complex NP-hard optimization problem. A first model is presented that tries to solve the Job Shop scheduling problem together with the scheduling of the transports. Since the model described can’t be solved in an efficient way using state-of-the-art methods, principally because of the large number of binary variables used to formulate the constraints of the problem.