Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines - Mines Saint-Étienne Access content directly
Journal Articles Journal of Mathematical Modelling and Algorithms in Operations Research Year : 2013

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.

Dates and versions

emse-00881377 , version 1 (08-11-2013)

Identifiers

Cite

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, 2013, Volume 12 (Issue 2), pp 155-165. ⟨10.1007/s10852-012-9199-z⟩. ⟨emse-00881377⟩
110 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More