A High Performing Memetic Algorithm for the Flowshop Scheduling Problem With Blocking.
Quan-Ke PanLing WangHong-yan SangJunqing LiMin LiuPublished in: IEEE Trans Autom. Sci. Eng. (2013)
Keyphrases
- memetic algorithm
- scheduling problem
- flowshop
- tabu search
- single machine
- minimizing makespan
- job shop scheduling problem
- bicriteria
- setup times
- processing times
- minimizing total tardiness
- sequence dependent setup times
- feasible solution
- total tardiness
- np hard
- makespan minimization
- job shop
- total flowtime
- special case
- simulated annealing
- vehicle routing problem
- flowshop scheduling
- test problems
- permutation flowshop
- maximum lateness
- parallel machines
- search algorithm
- metaheuristic
- precedence constraints
- crossover operator
- artificial intelligence
- preventive maintenance
- total weighted tardiness
- flowshop scheduling problems
- evolutionary computation
- genetic algorithm
- computational complexity
- fitness function
- strongly np hard
- release dates
- genetic programming