Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic.
Majid KhaliliBahman NaderiPublished in: Int. J. Intell. Eng. Informatics (2014)
Keyphrases
- multi objective
- job shop scheduling problem
- metaheuristic
- total weighted tardiness
- tabu search
- sequence dependent setup times
- genetic algorithm
- simulated annealing
- evolutionary algorithm
- flowshop
- scheduling problem
- particle swarm optimization
- combinatorial optimization problems
- optimization problems
- makespan minimization
- job shop scheduling
- combinatorial optimization
- single machine scheduling problem
- single machine
- optimization algorithm
- ant colony optimization
- benchmark problems
- multi objective optimization
- objective function
- job shop
- setup times
- path relinking
- benchmark instances
- parallel machines
- search procedure
- optimal solution
- memetic algorithm
- search space
- feasible solution
- variable neighborhood search
- release dates
- precedence constraints
- test problems
- hybrid algorithm
- vehicle routing problem
- nsga ii
- np hard
- differential evolution
- processing times
- heuristic methods
- evolutionary computation
- lot sizing
- branch and bound algorithm
- traveling salesman problem
- crossover operator
- branch and bound
- particle swarm optimization pso
- genetic algorithm ga
- fitness function
- neural network
- computational efficiency
- genetic programming
- solution quality
- knapsack problem