A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines.
Andrew BilykLars MönchPublished in: J. Intell. Manuf. (2012)
Keyphrases
- unrelated parallel machines
- variable neighborhood search
- scheduling problem
- parallel machines
- setup times
- tabu search
- single machine scheduling problem
- flowshop
- metaheuristic
- single machine
- precedence constraints
- processing times
- scheduling jobs
- sequence dependent setup times
- release dates
- open shop
- heuristic methods
- completion times
- minimum spanning tree
- traveling salesman problem
- search procedure
- np hard
- job shop
- hybrid algorithm
- production planning
- memetic algorithm
- identical parallel machines
- resource consumption
- combinatorial optimization
- parallel computing
- job shop scheduling problem
- computational complexity
- lot sizing
- vehicle routing problem
- feasible solution
- optimization problems
- simulated annealing
- search space