The two-level lot-sizing problem with outbound shipment

Hark Chin Hwang, Jangha Kang

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

We consider the two-level lot-sizing problem for the integrated replenishment and dispatch plan of a third-party logistics company and distribution center. Each outbound shipment for a dispatch involves cargos that incur a stepwise transportation cost. To increase the effect of shipment consolidation, the distribution center allows backlogging. This problem has the characteristics of capacitated and uncapacitated lot-sizing. A forward dynamic program is applied to exploit the beneficial characteristic of the uncapacitated problem. The forward dynamic program is implemented using Zangwill partitions to decrease the number of computational parameters with legitimacy checks to guarantee optimality. Employing these techniques, we provide an O(T4) algorithm, which serves as an improvement on the O(T6) algorithm of previous research. Moreover, computational results from actual implementations show that our algorithm is significantly faster than that of prior research.

Original languageEnglish
Article number101997
JournalOmega
Volume90
DOIs
Publication statusPublished - Jan 2020

Bibliographical note

Publisher Copyright:
© 2018 Elsevier Ltd

Keywords

  • Algorithm
  • Inventory
  • Logistics
  • Lot-sizing
  • Shipment consolidation
  • Stepwise transportation cost

Fingerprint

Dive into the research topics of 'The two-level lot-sizing problem with outbound shipment'. Together they form a unique fingerprint.

Cite this