An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines.
Dorothea CalmelsPublished in: Eur. J. Oper. Res. (2022)
Keyphrases
- search procedure
- identical parallel machines
- scheduling problem
- single machine scheduling problem
- release dates
- tabu search
- processing times
- fixed number
- scheduling jobs
- simulated annealing
- search space
- single machine
- competitive ratio
- parallel machines
- search algorithm
- single server
- sequence dependent setup times
- hybrid algorithm
- precedence constraints
- np hard
- strongly np hard
- branch and bound
- particle swarm optimization
- completion times