Throughput optimization for micro-factories subject to failures

Abstract : In this report, we study the problem of optimizing the throughput for micro-factories subject to failures. The challenge consists in mapping several tasks onto a set of machines. One originality of the approach is the failure model for such applications, in which tasks are subject to failures rather than machines. If there is exactly one task per machine in the mapping, then we prove that the optimal solution can be computed in polynomial time. However, the problem becomes NP-hard if several tasks can be assigned to the same machine. Several polynomial time heuristics are presented for the most realistic specialized setting, in which tasks of a same type can be mapped onto a same machine. Experimental results show that the best heuristics obtain a good throughput, far from the throughput obtained with a random mapping. Moreover, we obtain a throughput close to the optimal solution in the particular cases on which the optimal throughput can be computed.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00374304
Contributor : Alexandru Dobrila <>
Submitted on : Wednesday, April 8, 2009 - 11:20:01 AM
Last modification on : Friday, July 6, 2018 - 3:06:07 PM
Long-term archiving on : Friday, October 12, 2012 - 4:26:03 PM

File

RR-6896.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00374304, version 1

Citation

Anne Benoit, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe. Throughput optimization for micro-factories subject to failures. [Research Report] RR-6896, INRIA. 2009, pp.24. ⟨inria-00374304⟩

Share

Metrics

Record views

617

Files downloads

226