An improved lower bound for rank four scheduling.
Lin ChenDeshi YeGuochuan ZhangPublished in: Oper. Res. Lett. (2014)
Keyphrases
- lower bound
- upper bound
- scheduling problem
- np hard
- branch and bound
- branch and bound algorithm
- optimal solution
- worst case
- lower and upper bounds
- objective function
- upper and lower bounds
- scheduling algorithm
- rank order
- parallel machines
- resource allocation
- resource constraints
- precedence constraints
- round robin
- vc dimension
- sample complexity
- single machine
- concept class
- rank aggregation
- real time database systems