Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead.
Wenjie LiJinjiang YuanJianfa CaoHailin BuPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- batch processing
- scheduling problem
- precedence constraints
- flowshop
- scheduling jobs
- parallel machines
- identical parallel machines
- identical machines
- fixed number
- unrelated parallel machines
- release dates
- unit length
- processing times
- single machine
- parallel machine scheduling problem
- sequence dependent setup times
- release times
- setup times
- maximum lateness
- job scheduling
- optimal scheduling
- single machine scheduling problem
- branch and bound algorithm
- computational complexity
- precedence relations
- minimize total
- strongly np hard
- computational grids
- completion times
- np hard
- special case
- job shop
- scheduling policies
- shared memory
- upper bound
- deteriorating jobs