Multiple Customers/Transporters Integrated Scheduling Problem to Minimize the Total Cost

摘要

In this paper, a Multiple Customers/Transporters Integrated Scheduling Problem is presented and analyzed.The objective is to minimize the total cost i.e. the delivery and inventory costs over the entire supply chain. Two methods of resolution are then presented and compared. The first one is a dedicated branch and bound, and the second one is commercial solver based on a MIP formulation of the considered problem. Their performances have been evaluated by comparing the resolution time required by each method as the number of transporter, customers and jobs increase. The experimental results show that the Branch and Bound algorithm is much more efficient than CPLEX solver for this problem.