Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds

DOI10.1007/s00291-015-0393-zzbMath1326.90037OpenAlexW2002100515MaRDI QIDQ747748

Sophie Weiss, Raik Stolletz

Publication date: 19 October 2015

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-015-0393-z

zbMATH Keywords

samplingboundsBenders decompositionbuffer allocationstochastic flow lines

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic scheduling theory in operations research (90B36)

Related Items (2)

Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems ⋮ The time buffer approximated buffer allocation problem: a row-column generation approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Manufacturing flow line systems: A review of models and analytical results
• Determining buffer location and size in production lines using tabu search
• Mathematical programming formulations for approximate simulation of multistage production systems
• Efficient algorithms for buffer space allocation
• Simulation optimization of buffer allocations in production lines with unreliable machines
• A simulated annealing approach for buffer allocation in reliable production lines
• A practical model of Heineken's bottle filling line with dependent failures
• Using linear programming to analyze and optimize stochastic flow lines
• A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Optimization Models of Discrete-Event System Dynamics

This page was built for publication: Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds