An improved algorithm for the lot-sizing problem with outbound shipment

Hark-Chin Hwang and Jangha Kang

Omega, 2021, vol. 100, issue C

Abstract: In this study, we propose an improved algorithm for the two-level lot-sizing problem with outbound shipment. Exploiting the synchronization relationship of inbound replenishment with outbound dispatch, we provide an efficient dynamic programming (DP) algorithm. We incorporate the structure of the DP with the geometric technique, which is known as the most efficient approach in solving lot-sizing problems, to design an O(T3) algorithm improving upon the previous O(T4) algorithm.

Keywords: Lot-sizing; Shipment consolidation; Stepwise transportation cost; Inventory and logistics; Algorithms (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0305048319307844
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:100:y:2021:i:c:s0305048319307844

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2020.102205

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().