The Periodic Joint Replenishment Problem is Strongly NP-Hard.
Tamar CohenLiron YedidsionPublished in: CoRR (2015)
Keyphrases
- strongly np hard
- scheduling problem
- lower bound
- setup times
- approximation algorithms
- permutation flowshop
- np hard
- branch and bound algorithm
- flowshop
- sequence dependent setup times
- single machine
- upper bound
- identical parallel machines
- neural network
- processing times
- parallel machines
- single machine scheduling problem
- multi item
- optimal solution