Tight upper bounds for semi-online scheduling on two uniform machines with known optimum.
György DósaArmin FügenschuhZhiyi TanZsolt TuzaKrzysztof WesekPublished in: Central Eur. J. Oper. Res. (2018)
Keyphrases
- upper bound
- lower bound
- worst case
- branch and bound algorithm
- tight bounds
- branch and bound
- online algorithms
- online learning
- parallel machines
- lower and upper bounds
- identical machines
- precedence constraints
- upper and lower bounds
- scheduling problem
- manufacturing cell
- error probability
- real time
- upper bounding
- vc dimension
- resource constraints
- sample size
- strongly np hard
- identical parallel machines