Using a Variable Neighborhood Search to Solve the Single Processor Scheduling Problem with Time Restrictions.
Rachid BenmansourOliver BraunSaïd HanafiNenad MladenovicPublished in: ICVNS (2018)
Keyphrases
- single processor
- scheduling problem
- variable neighborhood search
- tabu search
- parallel machines
- parallel processors
- parallel architectures
- single machine
- precedence constraints
- metaheuristic
- heuristic methods
- processing times
- single machine scheduling problem
- flowshop
- feasible solution
- simulated annealing
- np hard
- benchmark instances
- vehicle routing problem
- search procedure
- routing problem
- genetic algorithm
- minimum spanning tree
- evolutionary algorithm
- lower bound