A parallel competitive colonial algorithm for JIT flowshop scheduling.
Javad BehnamianPublished in: J. Comput. Sci. (2014)
Keyphrases
- trade off
- flowshop scheduling
- dynamic programming
- improved algorithm
- objective function
- parallel implementation
- times faster
- experimental evaluation
- matching algorithm
- optimization algorithm
- theoretical analysis
- worst case
- k means
- search algorithm
- parallel processing
- significant improvement
- high accuracy
- segmentation algorithm
- search space
- preprocessing
- greedy algorithm
- probabilistic model
- detection algorithm
- scheduling problem
- neural network
- computational cost
- np hard
- special case
- genetic algorithm