Solving the Unrelated Parallel Machine Scheduling Problem with Setups Using Late Acceptance Hill Climbing.
Mourad TerziTaha ArbaouiFarouk YalaouiKarima BenatchbaPublished in: ACIIDS (1) (2020)
Keyphrases
- hill climbing
- systematic search
- simulated annealing
- parallel machine scheduling problem
- search space
- search algorithm
- hybrid algorithms
- max min
- genetic algorithm ga
- search strategy
- search procedure
- scheduling problem
- combinatorial optimization
- steepest ascent
- genetic algorithm
- tabu search
- benchmark problems
- mathematical model
- parallel machines
- release dates
- sequence dependent setup times
- metaheuristic
- lower bound