Stochastic algorithms for buffer allocation in reliable production lines (Q1570012)

From MaRDI portal
Revision as of 03:57, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Stochastic algorithms for buffer allocation in reliable production lines
scientific article

    Statements

    Stochastic algorithms for buffer allocation in reliable production lines (English)
    0 references
    20 September 2000
    0 references
    Summary: 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.
    0 references
    simulated annealing
    0 references
    genetic algorithms
    0 references
    buffer allocation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references