A polynomial algorithm for the three‐machineopen shop with a bottleneck machine.
Inna G. DrobouchevitchVitaly A. StrusevichPublished in: Ann. Oper. Res. (1999)
Keyphrases
- search space
- learning algorithm
- experimental evaluation
- computational complexity
- optimization algorithm
- np hard
- computational cost
- detection algorithm
- theoretical analysis
- worst case
- significant improvement
- high accuracy
- improved algorithm
- expectation maximization
- single pass
- neural network
- selection algorithm
- polynomial delay
- parallel machines
- memory requirements
- times faster
- path planning
- particle swarm optimization
- k means
- lower bound
- decision trees