A multi-product dynamic inbound ordering and shipment scheduling problem at a third-party warehouse

Authors

  • Byung Soo Kim Pukyong National University
  • Woon-Seek Lee Pukyong National University

DOI:

https://doi.org/10.23055/ijietap.2013.20.1-2.481

Keywords:

dynamic demand, multiple products, ordering and shipment scheduling, third-party warehouse

Abstract

This paper considers a dynamic inbound ordering and shipment scheduling problem for multiple products that are transported from a supplier to a warehouse by common freight containers. The following assumptions are made: (i) ordered products in a period are immediately shipped in the same period, (ii) the total freight cost is proportional to the number of containers used, and (iii) demand is dynamic and backlogging is not allowed. The objective of this study is to identify effective algorithms that simultaneously determine inbound ordering lot-sizes and a shipment schedule that minimize the total cost consisting of ordering cost, inventory holding cost, and freight cost. This problem can be shown in NP-hard, and this paper presents a heuristic algorithm that exploits the properties of an optimal solution. Also, a shortest path reformulation model is proposed to obtain a good lower bound. Simulation experiments are presented to evaluate the performance of proposed procedures.

Author Biographies

Byung Soo Kim, Pukyong National University

Research Professor,

Department of Systems Management & Engineering
Pukyong National University
Busan 608-737, Korea

Woon-Seek Lee, Pukyong National University

Professor,

Department of Systems Management & Engineering
Pukyong National University
Busan 608-737, Korea

Published

2013-04-07

How to Cite

Kim, B. S., & Lee, W.-S. (2013). A multi-product dynamic inbound ordering and shipment scheduling problem at a third-party warehouse. International Journal of Industrial Engineering: Theory, Applications and Practice, 20(1-2). https://doi.org/10.23055/ijietap.2013.20.1-2.481

Issue

Section

Logistics and Material Handling