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

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.
Type de document :
Article dans une revue
Journal of Mathematical Modelling and Algorithms in Operations Research, Springer Netherlands, 2013, Volume 12 (Issue 2), pp 155-165. 〈10.1007/s10852-012-9199-z〉
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00881377
Contributeur : Florent Breuil <>
Soumis le : vendredi 8 novembre 2013 - 10:34:45
Dernière modification le : dimanche 28 janvier 2018 - 15:22:05

Lien texte intégral

Identifiants

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 Netherlands, 2013, Volume 12 (Issue 2), pp 155-165. 〈10.1007/s10852-012-9199-z〉. 〈emse-00881377〉

Partager

Métriques

Consultations de la notice

161