A DE-based algorithm for reentrant permutation flow-shop scheduling with different job reentrant times.
Bin QianJing WanBo LiuRong HuGuo-Lin ChePublished in: CISched (2013)
Keyphrases
- detection algorithm
- learning algorithm
- expectation maximization
- linear programming
- experimental evaluation
- times faster
- tree structure
- objective function
- optimization algorithm
- theoretical analysis
- simulated annealing
- high accuracy
- worst case
- k means
- computational complexity
- optimal solution
- probabilistic model
- similarity measure
- clustering method
- single pass
- improved algorithm
- recognition algorithm
- convex hull
- combinatorial optimization
- feature selection
- classification algorithm
- preprocessing
- artificial neural networks
- particle swarm optimization
- data sets
- computational cost