Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead.
Wenhua LiZhenkun ZhangSufang YangPublished in: Inf. Process. Lett. (2012)
Keyphrases
- online algorithms
- identical machines
- unit length
- precedence constraints
- scheduling problem
- lower bound
- branch and bound algorithm
- parallel machines
- competitive ratio
- identical parallel machines
- online learning
- processing times
- worst case
- learning algorithm
- single machine
- release dates
- batch mode
- approximation algorithms
- maximum lateness
- average case
- upper bound
- global constraints
- np hard
- flowshop
- asymptotically optimal
- partially ordered
- batch processing machines
- single machine scheduling problem
- partial order
- shared memory
- scheduling algorithm