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

DOI10.1016/j.orl.2012.12.004zbMath1262.90197OpenAlexW2055301886MaRDI QIDQ1949675

Retsef Levi, Liron Yedidsion

Publication date: 14 May 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.12.004

zbMATH Keywords

computational complexityinventory managementassembly line

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)

Related Items (1)

Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem

This page was built for publication: NP-hardness proof for the assembly problem with stationary setup and additive holding costs