A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs.
T. K. VaradharajanChandrasekharan RajendranPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- total flowtime
- simulated annealing algorithm
- scheduling problem
- multi objective
- permutation flowshop
- minimizing makespan
- flowshop
- genetic algorithm
- simulated annealing
- evolutionary algorithm
- flowshop scheduling problems
- parallel machines
- single machine
- processing times
- multi objective optimization
- precedence constraints
- setup times
- optimization algorithm
- total tardiness
- np hard
- mutation operator
- tabu search
- release dates
- sequence dependent setup times
- strongly np hard
- job shop
- particle swarm optimization
- search algorithm
- flowshop scheduling
- objective function
- job shop scheduling problem
- nsga ii
- premature convergence
- dispatching rule
- benchmark problems
- optimization problems
- total weighted tardiness
- particle swarm
- optimization method
- differential evolution
- metaheuristic
- upper bound