Please use this identifier to cite or link to this item:
Hammoudan, Zakaria
Grunder, Olivier
Boudouh, Toufik
ElMoudni, Abdellah
Year of Publication: 
[Journal:] Logistics Research [ISSN:] 1865-0368 [Volume:] 9 [Year:] 2016 [Issue:] 1 [Pages:] 1-13
In today's manufacturing outlook, coordinated scheduling of delivery and inventory represents a leading leverage to enhance the competitiveness of firms which aims to address the new challenge coming from scheduling problems. Though in the last decades this kind of issue has been extensively approached in the literature, a set of constraints and compulsory dispositions strongly increases the complexity of the considered problem. Actors of the pharmaceutical supply chain have to meet various global regulatory requirements while handling, storing and distributing environmentally sensitive products. The studied problem in this paper focuses on a real-case scheduling problem in a multi-location hospital supplied with a central pharmacy. The objective of this work is to find a coordinated production and delivery schedule such that the sum of delivery and inventory costs is minimized. A mixed-integer programming formulation is first detailed to consider the problem under study. Then, a branch-and-bound algorithm is proposed as an exact method and a dedicated heuristic algorithm is highlighted to solve the problem. At last, the experimental results show the efficiency of the proposed solving methods, based on the two following criteria: solution quality and processing time.
Case study
Coordinated scheduling
Production and transportation
Mixed-integer programming
Branch and bound
Heuristic algorithm
Persistent Identifier of the first edition: 
Creative Commons License:
Document Type: 

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.