Hardness of Approximating Flow and Job Shop Scheduling Problems.
Monaldo MastrolilliOla SvenssonPublished in: J. ACM (2011)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- particle swarm algorithm
- tabu search
- benchmark problems
- combinatorial optimization problems
- memetic algorithm
- simulated annealing
- scheduling problem
- genetic algorithm
- computational complexity
- graph model
- particle swarm optimisation
- worst case
- np hard
- tabu search algorithm
- evolutionary computation
- cost function
- bayesian networks
- social networks