Assesing The Performance of Different S-Metaheuristics To Solve Unrestricted Parallel Identical Machines Scheduling Problem.
Claudia Ruth Gatica de VidelaSusana Cecilia EsquivelMario Guillermo LeguizamónPublished in: Inteligencia Artif. (2013)
Keyphrases
- identical machines
- scheduling problem
- single machine
- processing times
- tabu search
- job scheduling
- precedence constraints
- flowshop
- np hard
- setup times
- genetic algorithm
- strongly np hard
- metaheuristic
- parallel machines
- release dates
- polynomial time approximation
- maximum lateness
- simulated annealing
- optimization problems
- scheduling jobs
- feasible solution
- sequence dependent setup times
- optimal solution
- particle swarm optimization