Multiple Customers/Transporters Integrated Scheduling Problem to Minimize the Total Cost
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | Multiple Customers/Transporters Integrated Scheduling Problem to Minimize the Total Cost |
Type de publication | Journal Article |
Year of Publication | 2016 |
Auteurs | Hammoudan Z., Ahmed F.S, Grunder O., El-Moudni A. |
Journal | IFAC PAPERSONLINE |
Volume | 49 |
Pagination | 892-897 |
Type of Article | Proceedings Paper |
ISSN | 2405-8963 |
Mots-clés | Branch and Bound, Delivery and Inventory, Integrated Scheduling, multiple customers |
Résumé | In tires paper, Multiple Customers/Transport 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 I. is much more efficient than CPIJA solver for this problem. (C) 2016, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All right reserved. |
DOI | 10.1016/j.ifacol.2016.07.888 |