Online scheduling with equal processing times and machine eligibility constraints.
Jia XuZhaohui LiuPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- processing times
- identical machines
- scheduling problem
- scheduling jobs
- flowshop
- single machine
- scheduling decisions
- release dates
- job processing times
- precedence constraints
- setup times
- precedence relations
- manufacturing cell
- parallel machines
- sequence dependent setup times
- identical parallel machines
- completion times
- makespan minimization
- strongly np hard
- number of tardy jobs
- release times
- total weighted tardiness
- single machine scheduling problem
- shortest processing time
- online learning
- polynomially solvable
- resource consumption
- special case
- batch processing
- job shop
- competitive ratio
- worst case performance ratio
- tabu search
- communication delays
- earliness tardiness
- assembly line
- job shop scheduling problem
- scheduling algorithm
- constraint programming
- np hard