Complexity of buffer capacity allocation problems for production lines with unreliable machines

DOI10.1007/s10852-012-9199-zzbMath1311.90195OpenAlexW1969851341MaRDI QIDQ367250

Mikhail Y. Kovalyov, Alexandre Dolgui, Anton Valentinovich Eremeev, V. S. Sigaev

Publication date: 26 September 2013

Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-012-9199-z

zbMATH Keywords

optimizationcomputational complexityunreliable machinesbuffer allocationflow-line

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Reliability, availability, maintenance, inspection in operations research (90B25) Production models (90B30)

Related Items (4)

A continuous buffer allocation model using stochastic processes ⋮ Analysis of a multicriterial buffer capacity optimization problem for a production line ⋮ Hybridizations of evolutionary algorithms with large neighborhood search ⋮ The time buffer approximated buffer allocation problem: a row-column generation approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Manufacturing flow line systems: A review of models and analytical results
• The throughput rate of multistation unreliable production lines
• An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
• A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines
• Efficient algorithms for buffer space allocation
• Influence of Storage Bin Capacity on the Average Standstill Time of a Production Line

This page was built for publication: Complexity of buffer capacity allocation problems for production lines with unreliable machines