Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs.
Qian WangJi TianRuyan FuXiangjuan YaoPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- batch processing machines
- online algorithms
- maximum lateness
- single machine
- competitive ratio
- scheduling problem
- release dates
- online learning
- learning algorithm
- lower bound
- sequence dependent setup times
- parallel machines
- worst case
- average case
- precedence constraints
- processing times
- flowshop
- single machine scheduling problem
- setup times
- upper bound
- simulated annealing
- semi supervised
- state space
- np hard