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.
- Assembly line
- Computational complexity
- Inventory management
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics