Economic lot sizing problem with tank scheduling

Name: Economic lot sizing problem with tank scheduling
Author: Önal, Mehmet, van den Heuvel, W., Dereli, Meryem Merve, Albey, Erinç

İsim	Economic lot sizing problem with tank scheduling
Yazar	Önal, Mehmet, van den Heuvel, W., Dereli, Meryem Merve, Albey, Erinç
Basım Tarihi:	2023-07-01
Basım Yeri	- Elsevier
Konu	Complexity analysis, Economic lot sizing, Fermentation tank scheduling, Production
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0377-2217
Kayıt Numarası	8b20e73b-afc7-4e96-9f9d-ff8f7fea38c9
Lokasyon	Industrial Engineering
Tarih	2023-07-01
Örnek Metin	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

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Economic lot sizing problem with tank scheduling

Yazar Önal, Mehmet, van den Heuvel, W., Dereli, Meryem Merve, Albey, Erinç

Basım Tarihi 2023-07-01

Basım Yeri - Elsevier

Konu Complexity analysis, Economic lot sizing, Fermentation tank scheduling, Production

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0377-2217

Kayıt Numarası 8b20e73b-afc7-4e96-9f9d-ff8f7fea38c9

Lokasyon Industrial Engineering

Tarih 2023-07-01

Örnek Metin 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