Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time.
Donald DavendraRoman SenkerikIvan ZelinkaMichal PluhacekMagdalena Bialic-DavendraPublished in: Soft Comput. (2014)
Keyphrases
- scheduling problem
- flowshop
- lot streaming
- bicriteria
- strongly np hard
- np hard
- optimization algorithm
- computational complexity
- cost function
- parallel machines
- tabu search
- job shop scheduling problem
- objective function
- simulated annealing
- optimal solution
- neural network
- minimizing makespan
- particle swarm optimization
- dynamic programming
- minimizing total tardiness
- flowshop scheduling
- permutation flowshop
- precedence constraints
- approximation algorithms
- knapsack problem
- single machine
- optimization method
- multistage