A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness.
S. David WuEui-Seok ByeonRobert H. StorerPublished in: Oper. Res. (1999)
Keyphrases
- job shop scheduling problem
- graph theoretic
- job shop scheduling
- scheduling problem
- critical path
- production scheduling
- job shop
- benchmark problems
- genetic algorithm
- tabu search
- memetic algorithm
- graph theory
- simulated annealing
- combinatorial optimization problems
- graph model
- tabu search algorithm
- random graphs
- weighted tardiness
- combinatorial optimization
- metaheuristic
- multi objective
- artificial neural networks
- graph properties
- optimal solution