A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness.
Reza Tavakkoli-MoghaddamM. KhaliliB. NaderiPublished in: Soft Comput. (2009)
Keyphrases
- weighted tardiness
- sequence dependent setup times
- minimize total
- scheduling problem
- job shop
- flowshop
- single machine
- parallel machines
- tabu search
- single machine scheduling problem
- simulated annealing
- job shop scheduling problem
- release dates
- setup times
- benchmark problems
- combinatorial optimization
- precedence constraints
- processing times
- hybrid algorithm
- metaheuristic
- total cost
- np hard
- lot sizing
- special case
- search procedure
- solution quality
- feasible solution
- particle swarm optimization pso
- combinatorial optimization problems
- optimization problems
- branch and bound algorithm
- memetic algorithm
- single server
- genetic algorithm
- multistage
- search space