This work presents two Mixed-Integer Linear Programming models to solve a pickup and delivery problem from a Portuguese company. The objective is to determine the minimum travel time for the pickup and delivery of manufacturing tools of the Manufacturing Tool Repair support service, of this company. The contribution of this work involves the presentation of two three-index mathematical models. Those models reflect the integration of the Simultaneous Delivery and Pickup Problem, with the Capacitated Vehicle Routing Problem with Time Windows. The two mixed-integer linear model formulations are presented and used to solve the problem using several real-world test instances. It is also compared their performance using some benchmark instances, proving its feasibility and comparing its behavior.