The time buffer approximated buffer allocation problem: a row-column generation approach
From MaRDI portal
Publication:2289911
DOI10.1016/j.cor.2019.104835zbMath1458.90224OpenAlexW2983413235WikidataQ105787947 ScholiaQ105787947MaRDI QIDQ2289911
Erica Pastore, Arianna Alfieri, Andrea Matta
Publication date: 27 January 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104835
assembly linesexact methodsimulation-optimizationbuffer allocationrow and column generationmath programming
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- Hybrid approach for buffer allocation in open serial production lines
- A stabilized structured Dantzig-Wolfe decomposition method
- Complexity of buffer capacity allocation problems for production lines with unreliable machines
- Column generation for extended formulations
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds
- Manufacturing flow line systems: A review of models and analytical results
- Stochastic adaptive search for global optimization.
- Performance analysis and buffer allocations in some open assembly systems.
- Mathematical programming formulations for approximate simulation of multistage production systems
- Efficient algorithms for buffer space allocation
- A simulated annealing approach for buffer allocation in reliable production lines
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A continuous buffer allocation model using stochastic processes
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Feature Article: Optimization for simulation: Theory vs. Practice
- An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
- Ordinal optimisation and simulation
- Optimization Models of Discrete-Event System Dynamics
- Introduction to Stochastic Search and Optimization
- A Global Search Method for Discrete Stochastic Optimization
- Selected Topics in Column Generation
- Stationary Waiting Times in m-Node Tandem Queues With Production Blocking
- Design and analysis of simulation experiments
This page was built for publication: The time buffer approximated buffer allocation problem: a row-column generation approach