A general approach for optimizing regular criteria in the job-shop scheduling problem.
Yazid MatiStéphane Dauzère-PérèsChams LahlouPublished in: Eur. J. Oper. Res. (2011)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- tabu search
- critical path
- scheduling problem
- simulated annealing
- special case
- benchmark problems
- production scheduling
- memetic algorithm
- job shop
- benchmark instances
- graph model
- artificial intelligence
- genetic algorithm
- total weighted tardiness
- neural network
- optimization problems
- optimal solution
- machine learning