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

Affiliation auteurs!!!! Error affiliation !!!!
TitreMultiple Customers/Transporters Integrated Scheduling Problem to Minimize the Total Cost
Type de publicationJournal Article
Year of Publication2016
AuteursHammoudan Z., Ahmed F.S, Grunder O., El-Moudni A.
JournalIFAC PAPERSONLINE
Volume49
Pagination892-897
Type of ArticleProceedings Paper
ISSN2405-8963
Mots-clésBranch 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.

DOI10.1016/j.ifacol.2016.07.888