A Polynomial Algorithm for a Two-Job Shop Scheduling Problem with Routing Flexibility.
Yazid MatiXiaolan XiePublished in: ICRA (2003)
Keyphrases
- job shop scheduling problem
- benchmark problems
- simulated annealing
- cost function
- dynamic programming
- optimization algorithm
- memetic algorithm
- critical path
- tabu search algorithm
- neural network
- clustering method
- routing problem
- test problems
- combinatorial optimization
- tabu search
- worst case
- scheduling problem
- np hard
- similarity measure