Online scheduling of incompatible unit-length job families with lookahead.
Wenhua LiJinjiang YuanSufang YangPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- unit length
- precedence constraints
- scheduling problem
- online learning
- release dates
- release times
- processing times
- scheduling jobs
- job search
- job shop
- maximum lateness
- job scheduling
- single machine
- identical parallel machines
- real time
- round robin
- batch processing
- identical machines
- special case
- parallel machines
- flowshop
- upper bound
- deteriorating jobs
- genetic algorithm