Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead.
Chengwen JiaoJinjiang YuanQi FengPublished in: Asia Pac. J. Oper. Res. (2019)
Keyphrases
- online algorithms
- identical machines
- unit length
- precedence constraints
- competitive ratio
- identical parallel machines
- scheduling problem
- lower bound
- branch and bound algorithm
- parallel machines
- online learning
- processing times
- worst case
- single machine
- learning algorithm
- release dates
- approximation algorithms
- np hard
- flowshop
- average case
- single machine scheduling problem
- batch mode
- partial order
- asymptotically optimal
- upper bound
- global constraints
- maximum lateness
- branch and bound
- partially ordered
- wafer fabrication
- shared memory
- e learning
- objective function