A Hybrid Discrete Memetic Algorithm for Solving Flow-Shop Scheduling Problems.
Levente FazekasBoldizsár Tüü-SzabóLászló T. KóczyOlivér HornyákKároly NehézPublished in: Algorithms (2023)
Keyphrases
- memetic algorithm
- scheduling problem
- tabu search
- flowshop
- timetabling problem
- job shop scheduling problem
- job shop
- combinatorial optimization
- single machine
- feasible solution
- setup times
- metaheuristic
- processing times
- strongly np hard
- sequence dependent setup times
- minimizing makespan
- flowshop scheduling
- vehicle routing problem
- genetic algorithm
- np hard
- asymptotic optimality
- test problems
- parallel machines
- total tardiness
- precedence constraints
- evolutionary computation
- maximum lateness
- special case
- job shop scheduling
- permutation flowshop
- simulated annealing
- search algorithm
- neural network
- flowshop scheduling problems
- state space
- traveling salesman problem
- production scheduling
- evolutionary algorithm
- greedy algorithm