Complexity of Bi-objective Buffer Allocation Problem in Systems with Simple Structure

2018 ◽  
pp. 278-287
Author(s):  
Alexandre B. Dolgui ◽  
Anton V. Eremeev ◽  
Mikhail Y. Kovalyov ◽  
Vyacheslav S. Sigaev
Keyword(s):  
Simple Structure ◽  
Allocation Problem ◽  
Buffer Allocation

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.

A Management Guide for Determination of Optimal Buffer Allocation in Unpaced Production Line Using 6 Steps OBA

2015 ◽  
Vol 793 ◽  
pp. 637-641 ◽  
Author(s):  
Mohd Shihabudin Ismail ◽  
M.I. Hussain ◽  
Zuraidah M. Zain ◽  
Noorhafiza Muhd
Keyword(s):  
Production Line ◽  
Processing Time ◽  
Simulation Method ◽  
Allocation Problem ◽  
Buffer Size ◽  
Assembly Process ◽  
Buffer Allocation ◽  
Throughput Rate ◽  
Simulation Results

This paper deals with a buffer allocation problem in unpaced μ-unbalanced production line. Unpaced line is referred to a line with workstations act independently and the material is not pulled by demand but in push mode. In this study, the production line is considered unpaced, μ-unbalanced but reliable. Mean processing time (μ) is the most difficult variable to fix constant in an actual production line due to the complexity of assembly process. The unbalance variance will become higher if the assembly process is more complex. The optimal buffer allocation need to be found for this particular type of production line so that it can maximize throughput rate and minimize total number of work-in-progress (WIP) on the line. This paper used a simulation method to simulate the throughput rate by given sets of buffer size. Based on the simulation results, a basic optimal buffer allocation (OBA) concept represented the characteristics of OBA for a production line was summarized. By applying the concept, a development of 6 Steps OBA tool is carried out. This tool could be utilized by a management in allocating the buffer during designing of the line layout.

The buffer allocation problem for general finite buffer queueing networks

2005 ◽  
Vol 37 (4) ◽  
pp. 343-365 ◽  
Author(s):  
J. MACGREGOR SMITH ◽  
F. R. B. CRUZ
Keyword(s):  
Queueing Networks ◽  
Allocation Problem ◽  
Finite Buffer ◽  
Buffer Allocation
Sign in / Sign up

Export Citation Format

Share Document