VNS Variant Approach Metaheuristics for Parallel Machines Scheduling Problem.
Claudia Ruth Gatica de VidelaSilvia M. MolinaGuillermo LeguizamónPublished in: CACIC (2022)
Keyphrases
- parallel machines
- scheduling problem
- tabu search
- variable neighborhood search
- makespan minimization
- metaheuristic
- single machine scheduling problem
- flowshop
- sequence dependent setup times
- single machine
- earliness tardiness
- path relinking
- precedence constraints
- total tardiness
- benchmark instances
- unrelated parallel machines
- np hard
- job shop scheduling problem
- minimize total
- total weighted tardiness
- processing times
- setup times
- feasible solution
- heuristic methods
- vehicle routing problem
- memetic algorithm
- weighted tardiness
- search procedure
- release dates
- hybrid algorithm
- maximum lateness
- open shop
- job shop
- traveling salesman problem
- single server
- scatter search
- scheduling jobs
- optimal solution
- ant colony optimization
- routing problem
- solution quality
- optimization problems
- pairwise