An Improved Quasi-physics and Quasi-human Algorithm for Solving the Job Shop Scheduling Problem.
Shousheng ZhangJie WuAihua YinPublished in: CSO (1) (2009)
Keyphrases
- job shop scheduling problem
- combinatorial optimization
- critical path
- benchmark problems
- k means
- computational complexity
- search space
- simulated annealing
- dynamic programming
- probabilistic model
- job shop scheduling
- information retrieval
- cost function
- objective function
- np hard
- linear programming
- tree structure
- search algorithm
- combinatorial optimization problems
- memetic algorithm
- artificial intelligence
- genetic algorithm