Scheduling Lower Bounds via AND Subset Sum.
Amir AbboudKarl BringmannDanny HermelinDvir ShabtayPublished in: ICALP (2020)
Keyphrases
- lower bound
- objective function
- min sum
- upper bound
- branch and bound
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- resource constraints
- lower and upper bounds
- optimal solution
- upper and lower bounds
- parallel machines
- scheduling algorithm
- resource allocation
- worst case
- round robin
- completion times
- real time database systems
- lower bounding
- minimize total
- optimal cost
- randomly generated problems
- weighted sum
- vc dimension
- flexible manufacturing systems
- special case