A linear time approximation algorithm for movement minimization in conveyor flow shop processing.
Wolfgang EspelageEgon WankePublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- objective function
- worst case
- computational complexity
- cost function
- np hard
- dynamic programming
- optimal solution
- optimization algorithm
- scheduling problem
- special case
- sufficient conditions
- ant colony optimization
- particle swarm optimization
- search space
- tabu search
- differential evolution
- combinatorial optimization
- manufacturing systems
- setup times