A Polynomial-time Algorithm for the Two-machine Unit-time Release-date Job-shop Schedule-length Problem.
Vadim G. TimkovskyPublished in: Discret. Appl. Math. (1997)
Keyphrases
- open shop
- job shop
- computational complexity
- dynamic programming
- k means
- similarity measure
- objective function
- job shop scheduling problem
- optimization algorithm
- cost function
- search space
- low cost
- simulated annealing
- np hard
- clustering method
- knapsack problem
- benchmark problems
- graph structure
- memetic algorithm
- special case