Solving the paintshop scheduling problem with memetic algorithms.
Wolfgang WeintrittNysret MusliuFelix WinterPublished in: GECCO (2021)
Keyphrases
- memetic algorithm
- tabu search
- scheduling problem
- timetabling problem
- combinatorial optimization
- simulated annealing
- assembly line balancing
- single machine
- np hard
- flowshop
- job shop scheduling problem
- vehicle routing problem
- metaheuristic
- test problems
- feasible solution
- processing times
- setup times
- special case
- step by step instructions
- precedence constraints
- strongly np hard
- search algorithm
- machine learning
- linear programming
- control system
- assembly line