Scheduling Lower Bounds via AND Subset Sum.
Amir AbboudKarl BringmannDanny HermelinDvir ShabtayPublished in: CoRR (2020)
Keyphrases
- lower bound
- objective function
- upper bound
- scheduling problem
- min sum
- branch and bound algorithm
- np hard
- scheduling algorithm
- branch and bound
- flexible manufacturing systems
- precedence constraints
- optimal solution
- optimal cost
- completion times
- upper and lower bounds
- lower and upper bounds
- round robin
- vc dimension
- randomly generated problems
- worst case
- lagrangian relaxation
- parallel machines
- single machine