A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem.
Shi Qiang LiuErhan KozanPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- job shop scheduling problem
- makespan minimization
- parallel machines
- benchmark problems
- scheduling problem
- simulated annealing
- critical path
- tabu search
- optimal solution
- k means
- memetic algorithm
- worst case
- parallel implementation
- list scheduling
- neural network
- job shop scheduling
- search procedure
- optimization algorithm
- genetic programming
- dynamic programming
- cost function
- combinatorial optimization
- total weighted tardiness