Multi-Neighborhood Search for the Makespan Minimization Problem on Parallel Identical Machines with Conflicting Jobs.
Roberto Maria RosatiDinh Quy TaMinh Hoàng HàAndrea SchaerfPublished in: MIC (2) (2024)
Keyphrases
- identical machines
- processing times
- neighborhood search
- polynomial time approximation
- single machine
- scheduling problem
- simulated annealing
- variable neighborhood search
- single machine scheduling problem
- flowshop
- setup times
- release dates
- traveling salesman problem
- np hard
- parallel machines
- tabu search
- path relinking
- approximation algorithms
- resource consumption
- precedence constraints
- evolutionary algorithm
- job shop scheduling problem