The disjunctive graph machine representation of the job shop scheduling problem.
Jacek BlazewiczErwin PeschMalgorzata SternaPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- job shop scheduling problem
- graph model
- job shop scheduling
- critical path
- tabu search
- production scheduling
- scheduling problem
- simulated annealing
- benchmark problems
- benchmark instances
- genetic algorithm
- graph structure
- memetic algorithm
- total weighted tardiness
- combinatorial optimization problems
- bipartite graph
- tabu search algorithm
- probabilistic model
- artificial intelligence