A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem.
Jingnan ShenLing WangJin DengXiaolong ZhengPublished in: ICHSA (2015)
Keyphrases
- bi objective
- flowshop
- harmony search algorithm
- scheduling problem
- multi objective
- lot streaming
- multi objective optimization
- particle swarm optimization
- tabu search
- minimizing makespan
- multiple objectives
- ant colony optimization
- initial solution
- harmony search
- multiobjective optimization
- evolutionary algorithm
- numerical optimization
- single machine
- processing times
- setup times
- optimization algorithm
- differential evolution
- nsga ii
- efficient solutions
- metaheuristic
- total tardiness
- minimizing total tardiness
- genetic algorithm
- total flowtime
- maximum lateness
- sequence dependent setup times
- flowshop scheduling
- permutation flowshop
- special case
- precedence constraints
- test functions
- preventive maintenance
- network design
- parallel machines
- np hard
- objective function
- artificial bee colony
- strongly np hard
- release dates
- job shop scheduling problem
- knapsack problem
- shortest path problem
- optimization problems
- fitness function
- simulated annealing
- global optimization
- multi objective evolutionary algorithms
- bp neural network
- combinatorial optimization problems
- neural network