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

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

Internet

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

Similar Items