Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines

Alexandre Dolgui 1, 2 Anton Eremeev Mikhail Y. Kovalyov 3 V. Sigaev 4
1 DEMO-ENSMSE - Département Décision en Entreprise : Modélisation, Optimisation
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes
3 NASB - National Academy of Sciences of Belarus
4 Mendeleev University of Chemical Technology of Russia
Abstract : Buffer capacity allocation problems for flow-line manufacturing systems with unreliable machines are studied. These problems arise in a wide range of manufacturing systems and concern determining buffer capacities with respect to a given optimality criterion which can depend on the average production rate of the line, buffer cost, inventory cost, etc. Here, this problem is proven to be NP-hard for a tandem production line and oracle representation of the revenue and cost functions, and NP-hard for a series-parallel line and stepwise revenue function.
Keywords : Flow-line Unreliable machines Buffer allocation Optimization Computational complexity
Document type :
Journal articles
Complete list of metadatas
https://hal-emse.ccsd.cnrs.fr/emse-00881377
Contributor : Florent Breuil <>
Submitted on : Friday, November 8, 2013 - 10:34:45 AM
Last modification on : Monday, January 20, 2020 - 12:12:05 PM

Links full text

openaccess

Identifiers

Collections

EMSE | DEMO-ENSMSE | FAYOL-ENSMSE | CNRS | LIMOS | PRES_CLERMONT | TDS-MACS | INSTITUT-TELECOM | SIGMA-CLERMONT

Citation

Alexandre Dolgui, Anton Eremeev, Mikhail Y. Kovalyov, V. Sigaev. Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines. Journal of Mathematical Modelling and Algorithms in Operations Research, Springer, 2013, Volume 12 (Issue 2), pp 155-165. ⟨10.1007/s10852-012-9199-z⟩. ⟨emse-00881377⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

262

Contact

Informations

CCSD