Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times.
Rene DriesselLars MönchPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- parallel machines
- sequence dependent setup times
- precedence constraints
- scheduling jobs
- total weighted tardiness
- single machine scheduling problem
- release dates
- scheduling problem
- variable neighborhood search
- total tardiness
- single machine
- lot sizing
- parallel computing
- setup times
- processing times
- tabu search
- shared memory
- identical parallel machines
- single server
- flowshop
- multistage
- metaheuristic
- identical machines
- computational complexity