Scheduling dedicated jobs with variative processing times.
Maksim BarketauErwin PeschYakov M. ShafranskyPublished in: J. Comb. Optim. (2016)
Keyphrases
- processing times
- scheduling problem
- identical machines
- identical parallel machines
- release dates
- scheduling jobs
- single machine
- precedence relations
- number of tardy jobs
- setup times
- release times
- job processing times
- flowshop
- scheduling decisions
- single machine scheduling problem
- sequence dependent setup times
- makespan minimization
- resource consumption
- total weighted tardiness
- polynomially solvable
- completion times
- communication delays
- earliness tardiness
- worst case performance ratio
- np hard
- parallel machines
- fixed number
- precedence constraints
- tabu search
- job shop
- job shop scheduling problem
- evolutionary algorithm
- production system
- scheduling algorithm
- assembly line