RUS  ENG
Полная версия
ЖУРНАЛЫ // Математическое моделирование // Архив

Матем. моделирование, 2018, том 30, номер 3, страницы 373–386 (Mi mm4086)

Эта публикация цитируется в 4 статьях

Статьи, опубликованные в английской версии журнала

Developing a new integrated bi-objective model for buffer and process time optimization problem using optimization via simulation approach

P. Azimi, N. Farhadi

Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

Аннотация: The cost of semi-finished products storage and processing time are two issues affecting the rate of manufacturing in all production systems. The acceleration in production time is usually associated with the increase of costs and lack of appropriate allocation of the production line buffers imposing production costs and increase in delivery time and decrease in productivity. Many previous studies have focused on deterministic production systems using mathematical programming models. Moreover, the optimization of buffers and processing times with stochastic events has not been considered simultaneously. In this study, a new simulation-based optimization model has been proposed to address the modeling and solving of buffer and processing time optimization problem in a stochastic environment. The real world problem has been modeled by using the simulation technique and the model replicated by a design of experiment method. The results were used to build a meta-model of regression for the objective functions and finally, a new mathematical model was solved by a multiobjective Genetic Algorithm. The results of this research show that the proposed approach has efficient solutions and could be easily applied to real world problems.

Ключевые слова: buffer optimization problem, optimal processing time, optimization via simulation, NSGA_II.

Поступила в редакцию: 01.11.2017

Язык публикации: английский


 Англоязычная версия: Mathematical Models and Computer Simulations, 2018, 10:3, 373–386

Реферативные базы данных:


© МИАН, 2024