Author
Önal, Mehmet, van den Heuvel, W., Dereli, Meryem Merve, Albey, Erinç
Publication Date
2023-07-01
Publication Place
-
Elsevier
Subject
Complexity analysis, Economic lot sizing, Fermentation tank scheduling, Production
Type
Periodical
Language
English
Digital
Yes
Manuscript
No
Library
Özyeğin University
Library Asset ID
0377-2217
Record ID
8b20e73b-afc7-4e96-9f9d-ff8f7fea38c9
Library Location
Industrial Engineering
Date
2023-07-01
Sample Text
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.
DOI
10.1016/j.ejor.2022.11.016
Cilt
308
