TY - JOUR
T1 - Economic lot sizing problem with tank scheduling
AU - Önal, Mehmet
AU - van den Heuvel, Wilco
AU - Dereli, Meryem Merve
AU - Albey, Erinç
N1 - Publisher Copyright:
© 2022 Elsevier B.V.
PY - 2023/7/1
Y1 - 2023/7/1
N2 - We introduce a multiple-item economic lot sizing problem where items are produced through the fermentation of some raw materials. Fermentation takes place in specialized tanks that have finite capacities, and duration of the fermentation process is item dependent. When fermentation starts, the tanks are not available for the duration of the fermentation process. We analyze the complexity of this problem under various assumptions on the number of items and tanks. In particular, we show that several cases of the problem are (strongly) NP-hard, and we propose polynomial time algorithms to some single item cases. In addition, we propose a quick and simple heuristic approach for one of the multiple item cases.
AB - We introduce a multiple-item economic lot sizing problem where items are produced through the fermentation of some raw materials. Fermentation takes place in specialized tanks that have finite capacities, and duration of the fermentation process is item dependent. When fermentation starts, the tanks are not available for the duration of the fermentation process. We analyze the complexity of this problem under various assumptions on the number of items and tanks. In particular, we show that several cases of the problem are (strongly) NP-hard, and we propose polynomial time algorithms to some single item cases. In addition, we propose a quick and simple heuristic approach for one of the multiple item cases.
UR - http://www.scopus.com/inward/record.url?scp=85143509528&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2022.11.016
DO - 10.1016/j.ejor.2022.11.016
M3 - Article
AN - SCOPUS:85143509528
SN - 0377-2217
VL - 308
SP - 166
EP - 182
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -