4.7 Article

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

Journal

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.omega.2020.102205

Keywords

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

Funding

  1. Chosun University(2020)

Ask authors/readers for more resources

In this study, an improved algorithm for the two-level lot-sizing problem with outbound shipment is proposed. By exploiting the synchronization relationship of inbound replenishment with outbound dispatch, an efficient dynamic programming algorithm is provided. Incorporating the structure of the DP with the geometric technique has led to the design of an O(T-3) algorithm, improving upon the previous O(T-4) algorithm.
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-3) algorithm improving upon the previous O(T-4) algorithm. (c) 2020 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available