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


Weiss, Sophie ; Stolletz, Raik



DOI: https://doi.org/10.1007/s00291-015-0393-z
URL: https://link.springer.com/article/10.1007/s00291-0...
Additional URL: https://www.researchgate.net/publication/264808143...
Document Type: Article
Year of publication: 2015
The title of a journal, publication series: OR Spectrum
Volume: 37
Issue number: 4
Page range: 869-902
Place of publication: Berlin ; Heidelberg
Publishing house: Springer
ISSN: 0171-6468 , 1436-6304
Publication language: English
Institution: Business School > ABWL u. Produktion (Stolletz)
Subject: 330 Economics
Keywords (English): Buffer allocation , Stochastic flow lines , Benders Decomposition , Sampling , Bounds
Abstract: The allocation of buffer space in flow lines with stochastic processing times is an important decision, as buffer capacities influence the performance of these lines. The objective of this problem is to minimize the overall number of buffer spaces achieving at least one given goal production rate. We optimally solve this problem with a mixed-integer programming approach by sampling the effective processing times. To obtain robust results, large sample sizes are required. These incur large models and long computation times using standard solvers. This paper presents a Benders Decomposition approach in combination with initial bounds and different feasibilitycutsfortheBufferAllocationProblem,whichprovidesexactsolutionswhile reducing the computation times substantially. Numerical experiments are carried out to demonstrate the performance and the flexibility of the proposed approaches. The numerical study reveals that the algorithm is capable to solve long lines with reliable and unreliable machines, including arbitrary distributions as well as correlations of processing times.

Dieser Eintrag ist Teil der Universitätsbibliographie.




+ Citation Example and Export

Weiss, Sophie ; Stolletz, Raik (2015) Buffer allocation in stochastic flow lines via sample-based optimization with initial bounds. OR Spectrum Berlin ; Heidelberg 37 4 869-902 [Article]


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item