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

Hark Chin Hwang; Jangha Kang

doi:10.1016/j.omega.2020.102205

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

Hark Chin Hwang, Jangha Kang

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

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(T³) algorithm improving upon the previous O(T⁴) algorithm.

Original language	English
Article number	102205
Journal	Omega
Volume	100
DOIs	https://doi.org/10.1016/j.omega.2020.102205
Publication status	Published - Apr 2021

Bibliographical note

Publisher Copyright:
© 2020

Keywords

Algorithms
Inventory and logistics
Lot-sizing
Shipment consolidation
Stepwise transportation cost

Access to Document

10.1016/j.omega.2020.102205

Cite this

@article{9bfeaf55f5aa43c0ab53f3fa0bed3608,

title = "An improved algorithm for the lot-sizing problem with outbound shipment",

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 = "Algorithms, Inventory and logistics, Lot-sizing, Shipment consolidation, Stepwise transportation cost",

author = "Hwang, {Hark Chin} and Jangha Kang",

note = "Publisher Copyright: {\textcopyright} 2020",

year = "2021",

month = apr,

doi = "10.1016/j.omega.2020.102205",

language = "English",

volume = "100",

journal = "Omega",

issn = "0305-0483",

publisher = "Elsevier B.V.",

}

TY - JOUR

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

AU - Hwang, Hark Chin

AU - Kang, Jangha

PY - 2021/4

Y1 - 2021/4

N2 - 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.

AB - 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.

KW - Algorithms

KW - Inventory and logistics

KW - Lot-sizing

KW - Shipment consolidation

KW - Stepwise transportation cost

UR - http://www.scopus.com/inward/record.url?scp=85079274427&partnerID=8YFLogxK

U2 - 10.1016/j.omega.2020.102205

DO - 10.1016/j.omega.2020.102205

M3 - Article

AN - SCOPUS:85079274427

SN - 0305-0483

VL - 100

JO - Omega

JF - Omega

M1 - 102205

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this