A polynomial algorithm for a two-machine no-wait job-shop scheduling problem.
Svetlana A. KravchenkoPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- memetic algorithm
- job shop scheduling problem
- benchmark instances
- job shop scheduling
- critical path
- genetic algorithm
- production scheduling
- computational complexity
- tabu search algorithm
- fuzzy logic
- simulated annealing
- search space
- dynamic programming
- particle swarm optimization
- random walk
- optimization algorithm
- tree structure
- benchmark problems
- graph model
- artificial neural networks
- similarity measure
- information retrieval