Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems
From MaRDI portal
Recommendations
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- The time buffer approximated buffer allocation problem: a row-column generation approach
- Stochastic algorithms for buffer allocation in reliable production lines
- Buffer allocation in flow-shop-type production systems with general arrival and service patterns
- A simulated annealing approach for buffer allocation in reliable production lines
Cites work
- scientific article; zbMATH DE number 3612796 (Why is no real title available?)
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A decomposition method for approximate evaluation of continuous flow multi-stage lines with general Markovian machines
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Analysis and design of discrete part production lines
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Efficient algorithms for buffer space allocation
- Efficient global optimization of expensive black-box functions
- Hybrid approach for buffer allocation in open serial production lines
- Mathematical programming formulations for approximate simulation of multistage production systems
- Production systems engineering
- Stochastic Modeling of Manufacturing Systems
- Using linear programming to analyze and optimize stochastic flow lines
Cited in
(2)
This page was built for publication: Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2241996)
