Stochastic Algorithms for Buffer Allocation in Reliable Production Lines

42Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Spinellis, D. D., & Papadopoulos, C. T. (2000). Stochastic Algorithms for Buffer Allocation in Reliable Production Lines. Mathematical Problems in Engineering, 5(6), 441–458. https://doi.org/10.1155/S1024123X99001180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free