Dynamic economic lot size model with perishable inventory and capacity constraints

Sargut, F. Zeynep; Işık, Gül

doi:10.1016/j.apm.2017.02.024

Cited by 30 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Stefansdottir et al [5] developed a generic optimization model for lot sizing and scheduling in the typical processing industry setting of flow shops. Sargut and Isık [6] presented a mathematical model for a dynamic economic lot sizing problem with a single machine for a single perishable item under production capacities. They also gave a dynamic programming-based heuristic for the solution of the overall problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

et al. 2021

View full text Add to dashboard Cite

This paper aims to study a real case of an optimization problem derived from a hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in hospital catering. The addressed production system is considered as a flexible job shop system. The objective is to minimize the total flow time. A novel mathematical model and two metaheuristics for the production scheduling of multi-product and multi-stage food processes are developed. These methods have proven their effectiveness for the scheduling of operations of the food production processes and allowed significant improvements in the performance of the studied production system.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

et al. 2021

View full text Add to dashboard Cite

show abstract

“… √ √ Emission minimization Önal et al (2015) Single echelon √ √ √ √ None None Bozorgi (2016) Single echelon √ √ √ Fixed + Var. √ √ Emission minimization Muriana (2016) Single echelon √ √ √ √ None None Önal (2016) Two echelon √ √ √ √ Simplified None Pauls-Worm et al (2016) Single echelon √ √ √ √ √ None None Sazvar et al (2016) Single echelon √ √ √ √ None None Sargut and Isik (2017) Single echelon √ √ √ None None Hariga et al (2017) Multi echelon √ √ ...…”

Section: Relevant Literaturementioning

confidence: 99%

Sustainable dynamic lot sizing models for cold products under carbon cap policy

As’ad

Hariga

Shamayleh

2020

Computers & Industrial Engineering

View full text Add to dashboard Cite

Highlights A cold product exhibiting a discrete time varying demand is considered. Two models are presented one for the total carbon cap and the other for periodic cap. A lagrangean relaxation and a bi-section method based algorithms are developed for Model 1. Model 2 is solved via a dynamic programming based algorithm. Sensitivity analysis is performed on the effect of the preset total and periodic caps.

show abstract

“…Fan and Wang (2018) mengembangkan algoritma program dinamis untuk menyelesaikan masalah optimasi lot gabungan dan ukuran gudang. Sargut and Işık (2017) mengembangkan model program dinamis model dengan mempertimbangkan perishable inventory and capacity constraints. Xu, Gong, Chu, and Zhang (2017) mengembangkan model program dinamis untuk retailers with online channels.…”

Section: Pendahuluanunclassified

Model Program Dinamis Untuk Lot Size Multi Item Dengan Kendala Kapasitas Gudang

Utama

2019

Teknik Industri

View full text Add to dashboard Cite

Persediaan bahan baku merupakan aktifitas yang penting dalam proses produksi. Pada makalah ini, model mempertimbangkan kuantitas dan periode pemesanan. Dalam model ini, pembeli tunggal membeli beberapa bahan baku dari satu pemasok. Permintaan bahan baku bersifat deterministik dan bervariasi untuk periode waktu. Selain itu, biaya pesan dan biaya simpan untuk periode perencanaan adalah tetap. Kami telah mengembangkan model pemrograman dinamis untuk mengatasi masalah ini. Model pemrograman dinamis ini dikembangkan dari algoritma Wagner-Whitin. Model program dinamis yang diusulkan mempertimbangkan multi item dan kendala kapasitas gudang. Untuk menguji performa dari model, peneliti melakukan beberapa percobaan numerik. Hasil percobaan numerik model pemrograman dinamis usulan menunjukan total biaya persediaan lebih optimal dibandingkan dengan metode EOQ. Hasil percobaan ini menunjukkan model usulan efektif minimasi total biaya persediaan. AbstractInventory of raw materials is an essential activity in the production process. In this paper, the model considers the quantity and order period. In this model, a single buyer buys several raw materials from one supplier. The demand for raw materials is deterministic and varies for a period of time. Besides, the message costs and save costs for the planning period are fixed. We have developed dynamic programming models to overcome this problem. This dynamic programming model was developed from the Wagner-Whitin algorithm. The proposed dynamic program model considers multi items and warehouse capacity constraints. To test the performance of the model, researchers conducted some numerical experiments. The numerical experimental results of the dynamic programming model suggest that the total inventory cost is more optimal compared to the EOQ method. The results of this experiment indicate the proposed model effectively minimizes the total cost of inventory.Keywords: Multi Item; Inventory; Wagner Whitin; Warehouse Constraints; Dynamic Programming

show abstract

Dynamic economic lot size model with perishable inventory and capacity constraints

Cited by 30 publications

References 18 publications

Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

Flexible Job Shop Scheduling Problem with Sequence Dependent Setup Time and Job Splitting: Hospital Catering Case Study

Sustainable dynamic lot sizing models for cold products under carbon cap policy

Model Program Dinamis Untuk Lot Size Multi Item Dengan Kendala Kapasitas Gudang

Contact Info

Product

Resources

About