A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.
Zhaocai WangZuwen JiXiaoming WangTunhua WuWei HuangPublished in: Biosyst. (2017)
Keyphrases
- computational model
- np hard
- scheduling problem
- k means
- dynamic programming
- learning algorithm
- optimal solution
- detection algorithm
- list scheduling
- strongly np hard
- parallel implementation
- optimization algorithm
- expectation maximization
- particle swarm optimization
- computational complexity
- ant colony optimization
- computational models
- computational modeling
- simulated annealing