The Continuous Joint Replenishment Problem is Strongly NP-Hard.

Alexander Tuisov Liron Yedidsion

Published in: CoRR (2020)

Keyphrases

strongly np hard
scheduling problem
lower bound
setup times
np hard
approximation algorithms
permutation flowshop
neural network
branch and bound algorithm
flowshop
computational complexity
special case
mathematical model
sequence dependent setup times