A 3/2 Algorithm for Two-Machine Open Shop with Route-Dependent Processing Times.
Vitaly A. StrusevichA. J. A. van de WaartRommert DekkerPublished in: J. Heuristics (1999)
Keyphrases
- processing times
- scheduling problem
- worst case performance ratio
- flowshop
- cost function
- dynamic programming
- particle swarm optimization
- linear programming
- np hard
- neural network
- benchmark problems
- search space
- open shop
- special case
- single machine
- hybrid algorithm
- computational complexity
- single machine scheduling problem
- polynomially solvable
- optimal solution