A memetic algorithm for the discrete scheduling-location problem with unrelated machines.
Miroslaw LawrynowiczJerzy JózefczykPublished in: MMAR (2019)
Keyphrases
- memetic algorithm
- job shop scheduling problem
- tabu search
- job shop
- scheduling problem
- parallel machines
- timetabling problem
- flowshop
- identical parallel machines
- assembly line balancing
- benchmark instances
- wafer fabrication
- identical machines
- evolutionary computation
- manufacturing cell
- combinatorial optimization
- scheduling algorithm
- crossover operator
- parallel processors
- genetic algorithm
- vehicle routing problem
- np hard
- search algorithm
- data mining
- single machine
- resource allocation
- information retrieval systems