A new method for the placement of buffers in serial production lines
From MaRDI portal
Publication:3055341
DOI10.1080/00207540801939022zbMath1198.90152OpenAlexW2083438345MaRDI QIDQ3055341
Hector A. Vergara, David S. Kim
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540801939022
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (2)
Hybrid approach for buffer allocation in open serial production lines ⋮ An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
Cites Work
- Symmetry property of the throughput in closed tandem queueing networks with finite buffers
- Stochastic algorithms for buffer allocation in reliable production lines
- Determining buffer location and size in production lines using tabu search
- A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines
- Efficient algorithms for buffer space allocation
- A simulated annealing approach for buffer allocation in reliable production lines
- The Reversibility Property of Production Lines
- Estimating the distribution and variance of time to produce a fixed lot size given deterministic processing times and random downtimes
- Heuristic algorithms for buffer allocation in a production line with unreliable machines
- Large production line optimization using simulated annealing
- Analysis and design of split and merge unpaced assembly systems by metamodelling and stochastic search
This page was built for publication: A new method for the placement of buffers in serial production lines
