Mixed binary integer programming formulations for the reentrant job shop scheduling problem.
Jason Chao-Hsien PanJen-Shiang ChenPublished in: Comput. Oper. Res. (2005)
Keyphrases
- job shop scheduling problem
- job shop scheduling
- integer programming formulations
- critical path
- tabu search
- genetic algorithm
- scheduling problem
- benchmark problems
- simulated annealing
- integer programming
- production scheduling
- memetic algorithm
- graph model
- benchmark instances
- combinatorial optimization problems
- linear program
- tabu search algorithm
- lower bound
- job shop
- combinatorial optimization
- np hard
- dynamic programming