Buffer Allocation Problem Using Meta-Model in an Automotive Body Shops with Mixed-model Production

2020 ◽  
Vol 46 (3) ◽  
pp. 296-308
Author(s):  
Young Hoon Lee ◽  
Yang Woo Shin ◽  
Dug Hee Moon
Keyword(s):  
Mixed Model ◽  
Allocation Problem ◽  
Buffer Allocation ◽  
Meta Model ◽  
Automotive Body

scholarly journals Automotive Body Shop Design Problems Using Meta-Models Considering Product-Mix Change and Reconfiguration Strategy

2021 ◽  
Vol 11 (6) ◽  
pp. 2748
Author(s):  
Dug Hee Moon ◽  
Dong Ok Kim ◽  
Yang Woo Shin
Keyword(s):  
Production Rate ◽  
Manufacturing System ◽  
Main Body ◽  
Buffer Allocation ◽  
Product Mix ◽  
Body Shop ◽  
Meta Model ◽  
Automotive Body ◽  
Electric Car ◽  
Side Body

The estimation of production rate (or throughput) is important in manufacturing system design. Herein, we consider the manufacturing system of an automotive body shop in which two types of car are produced, and one car (engine car) is substituted by the other car (electric car) gradually. In this body shop, two different underbody lines are installed because the underbody structures of the two types of cars differ completely; however, the side body line and main body line are shared by the two cars. Furthermore, we assume that the underbody lines are reconfigurable based on an increase in the product mix of the electric car. A simulation-based meta-model, which is in the form of a quadratic polynomial function, is developed to estimate the production rate. In the meta-modelling process, we group some buffer locations and represent them as one variable to reduce the number of variables included in the meta-model. Subsequently, the meta-models have been used to optimize two types of buffer allocation problems, and optimal solutions are obtained easily.

The state of the art on buffer allocation problem: a comprehensive survey

2012 ◽  
Vol 25 (3) ◽  
pp. 371-392 ◽  
Author(s):  
Leyla Demir ◽  
Semra Tunali ◽  
Deniz Tursel Eliiyi
Keyword(s):  
State Of The Art ◽  
The State ◽  
Allocation Problem ◽  
Buffer Allocation ◽  
Comprehensive Survey

A new method for solving buffer allocation problem in large unbalanced production lines

2019 ◽  
Vol 58 (22) ◽  
pp. 6846-6867 ◽  
Author(s):  
Shaohui Xi ◽  
Qingxin Chen ◽  
James MacGregor Smith ◽  
Ning Mao ◽  
Ailin Yu ◽  
...  
Keyword(s):  
Allocation Problem ◽  
New Method ◽  
Buffer Allocation ◽  
Production Lines

A fast algorithm for buffer allocation problem

2015 ◽  
Vol 54 (11) ◽  
pp. 3243-3255 ◽  
Author(s):  
Lei Li ◽  
YanLing Qian ◽  
Yong Min Yang ◽  
Kai Du
Keyword(s):  
Fast Algorithm ◽  
Allocation Problem ◽  
Buffer Allocation

Optimal buffer allocation in a two-stage queueing system

1993 ◽  
Vol 30 (02) ◽  
pp. 478-482
Author(s):  
Panayotis D. Sparaggis ◽  
Wei-Bo Gong
Keyword(s):  
Service Time ◽  
General Type ◽  
Optimal Allocation ◽  
Queueing System ◽  
Allocation Problem ◽  
Absolute Difference ◽  
Allocation Scheme ◽  
Buffer Allocation ◽  
Two Stage ◽  
The One

We study the buffer allocation problem in a two-stage cyclic queueing system. First, we show that transposing the number of buffers assigned to each queue does not affect the throughput. Second, we prove that the optimal buffer allocation scheme, in the sense of maximizing the system's throughput, is the one for which the absolute difference between the number of buffers, assigned to each queue, is minimized, i.e., it becomes either 0 or 1. This optimal allocation is insensitive to the general-type service-time distributions. These two distributions may be different and service times may even be correlated.

Sign in / Sign up

Export Citation Format

Share Document