A memetic algorithm for restoring feasibility in scheduling with limited makespan.
Raúl MencíaCarlos MencíaRamiro VarelaPublished in: Nat. Comput. (2022)
Keyphrases
- memetic algorithm
- scheduling problem
- tabu search
- job shop
- open shop
- job shop scheduling problem
- release dates
- flowshop
- unrelated parallel machines
- job shop scheduling
- evolutionary computation
- batch processing
- single machine
- assembly line balancing
- timetabling problem
- np hard
- benchmark instances
- genetic algorithm
- vehicle routing problem
- setup times
- precedence constraints
- combinatorial optimization
- scheduling algorithm
- deteriorating jobs
- parallel machines
- single machine scheduling problem
- production scheduling
- scheduling jobs
- batch processing machines
- test problems
- processing times
- optimal solution
- crossover operator
- maximum lateness
- feasible solution
- simulated annealing
- lower bound