A supply chain network design model for random-lifetime products

Design of a distribution network for perishable inventory is different and more challenging than for non-perishables. The complexity of design for perishable inventory is due to the limited lifetime of these products that restricts their duration and condition of storage. Further, under some circums...

Full description

Saved in:
Bibliographic Details
Published in:Journal of industrial and production engineering 2017-02, Vol.34 (2), p.113-123
Main Authors: Firoozi, Zahra, Ariafar, Shahram
Format: Article
Language:English
Subjects:
algorithms
Design engineering
heuristics and meta-heuristics
Inventories
Inventory control
Networks
Perishable goods
Policies
Probabilistic inventory models
Stockpiling
Storage facilities
supply chain management
Supply chains
Uncertainty
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Design of a distribution network for perishable inventory is different and more challenging than for non-perishables. The complexity of design for perishable inventory is due to the limited lifetime of these products that restricts their duration and condition of storage. Further, under some circumstances such as unusual weather condition or malfunction of transportation and storage facilities, the expected lifetime of products may fluctuate and make the situations more complicated. This study, therefore, develops a model for network design of perishable items, and takes into account the uncertainty of products lifetime. Since many uncertain parameters are difficult to be defined by known probability distribution functions, the developed model of this study deals with the uncertainty of lifetime by defining worst-case scenarios. The model determines the configuration and inventory control policy of the network concerning the defined scenarios. A Lagrangian relaxation-based heuristic algorithm is developed to solve the model.
ISSN:2168-1015
2168-1023
DOI:10.1080/21681015.2016.1237384