Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem.
Xiaohui LiFarouk YalaouiLionel AmodeoHicham ChehadePublished in: J. Intell. Manuf. (2012)
Keyphrases
- parallel machines
- scheduling problem
- exact methods
- np hard
- multi objective
- makespan minimization
- tabu search
- total tardiness
- single machine
- unrelated parallel machines
- flowshop
- optimal solution
- setup times
- lower bound
- particle swarm optimization
- sequence dependent setup times
- precedence constraints
- objective function
- processing times
- search methods
- integer programming
- exact solution
- vehicle routing problem
- branch and bound algorithm
- strongly np hard
- metaheuristic
- release dates
- np complete
- single server
- genetic algorithm
- evolutionary algorithm
- worst case
- heuristic methods
- parallel computing
- special case
- job shop scheduling problem
- shared memory
- decision problems
- linear programming
- simulated annealing
- lot sizing
- approximation algorithms
- reinforcement learning