NP-hardness proof for the assembly problem with stationary setup and additive holding costs.
Retsef LeviLiron YedidsionPublished in: Oper. Res. Lett. (2013)
Keyphrases
- np hardness
- setup cost
- holding cost
- assembly systems
- lot sizing
- mixed integer
- np hard
- lead time
- customer orders
- approximation algorithms
- total cost
- asymptotically optimal
- arrival rate
- multistage
- production cost
- heavy traffic
- expected cost
- production planning
- state dependent
- single item
- infinite horizon
- supply chain
- long run
- steady state
- high volume
- special case
- lower bound
- optimal solution
- average cost
- finite state
- integer programming
- linear programming
- planning horizon
- scheduling problem
- state space
- evolutionary algorithm