Evolving dispatching rules for dynamic Job shop scheduling with uncertain processing times.
Deepak KarunakaranYi MeiGang ChenMengjie ZhangPublished in: CEC (2017)
Keyphrases
- scheduling problem
- job shop scheduling
- processing times
- single machine
- job shop scheduling problem
- flowshop
- job shop
- setup times
- np hard
- tabu search
- polynomially solvable
- release dates
- precedence constraints
- precedence relations
- identical machines
- scheduling jobs
- parallel machines
- resource consumption
- worst case performance ratio
- production scheduling
- single machine scheduling problem
- search algorithm
- release times
- temporal information
- identical parallel machines
- graphical models
- computational complexity
- similarity measure