Optimal Foraging Algorithm That Incorporates Fuzzy Relative Entropy for Solving Many-Objective Permutation Flow Shop Scheduling Problems.
Guang-Yu ZhuChen DingWei-Bo ZhangPublished in: IEEE Trans. Fuzzy Syst. (2020)
Keyphrases
- scheduling problem
- relative entropy
- flowshop
- dynamic programming
- np hard
- strongly np hard
- optimal solution
- learning algorithm
- squared euclidean distance
- special case
- search space
- k means
- neural network
- probabilistic model
- similarity measure
- setup times
- job shop scheduling problem
- processing times
- information theoretic
- optimization algorithm
- expectation maximization
- particle swarm optimization
- information theory
- single machine
- ant colony optimization
- single machine scheduling problem
- sequence dependent setup times
- worst case