Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms

We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we ex...

Full description

Saved in:

Bibliographic Details
Main Authors:	LIN, Meichun, HUH, Woonghee Tim, WAN, Guohua
Format:	text
Language:	English
Published:	Institutional Knowledge at Singapore Management University 2021
Subjects:	Lot-sizing and scheduling Algorithm Computational complexity Supply chain Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
Online Access:	https://ink.library.smu.edu.sg/lkcsb_research/7303 https://ink.library.smu.edu.sg/context/lkcsb_research/article/8302/viewcontent/Multi_lot_Lot_sizing_av.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Singapore Management University
Language:	English

id	sg-smu-ink.lkcsb_research-8302
record_format	dspace
spelling	sg-smu-ink.lkcsb_research-83022023-10-26T06:10:16Z Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms LIN, Meichun HUH, Woonghee Tim WAN, Guohua We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we extend the classical zero-inventory-ordering principle and solve it by dynamic programming. Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well. 2021-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/lkcsb_research/7303 info:doi/10.1016/j.orl.2021.05.013 https://ink.library.smu.edu.sg/context/lkcsb_research/article/8302/viewcontent/Multi_lot_Lot_sizing_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Lot-sizing and scheduling Algorithm Computational complexity Supply chain Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
institution	Singapore Management University
building	SMU Libraries
continent	Asia
country	Singapore Singapore
content_provider	SMU Libraries
collection	InK@SMU
language	English
topic	Lot-sizing and scheduling Algorithm Computational complexity Supply chain Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering
spellingShingle	Lot-sizing and scheduling Algorithm Computational complexity Supply chain Operations and Supply Chain Management Operations Research, Systems Engineering and Industrial Engineering LIN, Meichun HUH, Woonghee Tim WAN, Guohua Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
description	We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we extend the classical zero-inventory-ordering principle and solve it by dynamic programming. Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well.
format	text
author	LIN, Meichun HUH, Woonghee Tim WAN, Guohua
author_facet	LIN, Meichun HUH, Woonghee Tim WAN, Guohua
author_sort	LIN, Meichun
title	Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
title_short	Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
title_full	Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
title_fullStr	Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
title_full_unstemmed	Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms
title_sort	multi-period lot-sizing with supplier selection: structural results, complexity and algorithms
publisher	Institutional Knowledge at Singapore Management University
publishDate	2021
url	https://ink.library.smu.edu.sg/lkcsb_research/7303 https://ink.library.smu.edu.sg/context/lkcsb_research/article/8302/viewcontent/Multi_lot_Lot_sizing_av.pdf
_version_	1781793963290656768

Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms

Similar Items