Tight lower 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. (2019)
Keyphrases
- lower bound
- upper bound
- online algorithms
- branch and bound algorithm
- np hard
- objective function
- scheduling problem
- worst case
- online learning
- parallel machines
- identical parallel machines
- branch and bound
- competitive ratio
- scheduling algorithm
- lower and upper bounds
- optimal solution
- upper and lower bounds
- wafer fabrication
- real time
- precedence constraints
- constraint satisfaction problems
- parallel processors
- manufacturing cell
- global optimum
- sample size
- lower bounding
- flexible manufacturing systems
- search algorithm