scholarly journals Stochastic algorithms for buffer allocation in reliable production lines

2000 ◽  
Vol 5 (6) ◽  
pp. 441-458 ◽  
Author(s):  
Diomidis D. Spinellis ◽  
Chrissoleon T. Papadopoulos
Keyword(s):  
Genetic Algorithms ◽  
Simulated Annealing ◽  
Decomposition Method ◽  
Manufacturing Systems ◽  
Optimization Problem ◽  
Allocation Problem ◽  
Stochastic Algorithms ◽  
Buffer Allocation ◽  
Production Lines

The allocation of buffers between workstations is a major optimization problem faced by manufacturing systems designers. It entails the determination of optimal buffer allocation plans in production lines with the objective of maximizing their throughput. We present and compare two stochastic approaches for solving the buffer allocation problem in large reliable production lines. The allocation plan is calculated subject to a given amount of total buffer slots using simulated annealing and genetic algorithms. The throughput is calculated utilizing a decomposition method.

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 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 in production lines: Formulations, solution methods, and instances

2018 ◽  
Vol 51 (5) ◽  
pp. 456-485 ◽  
Author(s):  
Sophie Weiss ◽  
Justus Arne Schwarz ◽  
Raik Stolletz
Keyword(s):  
Allocation Problem ◽  
Buffer Allocation ◽  
Production Lines ◽  
Solution Methods

Two approaches for solving the buffer allocation problem in unreliable production lines

2013 ◽  
Vol 40 (10) ◽  
pp. 2556-2563 ◽  
Author(s):  
Leyla Demir ◽  
Semra Tunalı ◽  
Deniz Türsel Eliiyi ◽  
Arne Løkketangen
Keyword(s):  
Allocation Problem ◽  
Buffer Allocation ◽  
Production Lines

A Novel Layout Approach to Production Line Using an Efficient Genetic Algorithm

2011 ◽  
Vol 467-469 ◽  
pp. 1680-1685
Author(s):  
Zhi Feng Liu ◽  
Jian Tan ◽  
Guo Ping An ◽  
Jian Hua Wang
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Production Line ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Large Scale ◽  
Scale Production ◽  
Production Lines ◽  
Large Scale Production

Models for the layout of production lines have been studied in this paper. First, it constructed a model of Multi-row Mix Integer Programming for the Flexible Manufacturing Systems. Secondly, using the genetic algorithms to analyze, it established the effective solutions. Finally, it completed the evaluation of the program. Demonstrating the feasibility and effectiveness method through the case of studies, a new method was given for the layout of large-scale production line.

scholarly journals A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines

2004 ◽  
Vol 2004 (3) ◽  
pp. 209-223 ◽  
Author(s):  
A. C. Diamantidis ◽  
C. T. Papadopoulos
Keyword(s):  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Allocation Problem ◽  
Programming Algorithm ◽  
Buffer Allocation ◽  
Production Lines ◽  
Aggregation Method ◽  
Serial Production ◽  
Large Production ◽  
Serial Production Lines

In this study, the buffer allocation problem (BAP) in homogeneous, asymptotically reliable serial production lines is considered. A known aggregation method, given by Lim, Meerkov, and Top (1990), for the performance evaluation (i.e., estimation of throughput) of this type of production lines when the buffer allocation is known, is used as an evaluative method in conjunction with a newly developed dynamic programming (DP) algorithm for the BAP. The proposed algorithm is applied to production lines where the number of machines is varying from four up to a hundred machines. The proposed algorithm is fast because it reduces the volume of computations by rejecting allocations that do not lead to maximization of the line's throughput. Numerical results are also given for large production lines.

Sign in / Sign up

Export Citation Format

Share Document