NP-hardness proof for the assembly problem with stationary setup and additive holding costs

Retsef Levi, Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper we answer a long-standing open question regarding the computational complexity of one of the core problems in inventory management, the assembly problem. In spite of effort on part of many researchers over the years to design efficient optimization algorithms for the problem, or alternatively prove that it is NP-hard, this fundamental question was left unanswered. In this paper, we provide a proof that the problem is indeed NP-hard, so it is not likely that there exists an efficient algorithm that solves the problem optimally.

Original languageEnglish
Pages (from-to)134-137
Number of pages4
JournalOperations Research Letters
Volume41
Issue number2
DOIs
StatePublished - 1 Mar 2013
Externally publishedYes

Keywords

  • Assembly line
  • Computational complexity
  • Inventory management

Fingerprint

Dive into the research topics of 'NP-hardness proof for the assembly problem with stationary setup and additive holding costs'. Together they form a unique fingerprint.

Cite this