Preemptive Semi-Online Scheduling with Tightly-Grouped Processing Times.
Yong HeYiwei JiangPublished in: J. Comput. Sci. Technol. (2004)
Keyphrases
- processing times
- scheduling problem
- single machine
- scheduling jobs
- release dates
- identical machines
- precedence relations
- setup times
- identical parallel machines
- number of tardy jobs
- flowshop
- online learning
- communication delays
- release times
- scheduling decisions
- single machine scheduling problem
- polynomially solvable
- job processing times
- tabu search
- makespan minimization
- np hard
- resource consumption
- earliness tardiness
- worst case performance ratio
- competitive ratio
- total weighted tardiness
- job shop
- assembly line
- precedence constraints
- parallel machines
- scheduling algorithm
- manufacturing cell
- sequence dependent setup times
- production scheduling
- genetic algorithm
- completion times
- lower bound