A hybrid heuristic to solve the parallel machines job-shop scheduling problem.
Andrea RossiElena BoschiPublished in: Adv. Eng. Softw. (2009)
Keyphrases
- reinforcement learning
- parallel machines
- job shop scheduling problem
- makespan minimization
- scheduling problem
- weighted tardiness
- total weighted tardiness
- job shop scheduling
- critical path
- precedence constraints
- tabu search
- unrelated parallel machines
- single machine
- sequence dependent setup times
- setup times
- minimize total
- production scheduling
- genetic algorithm
- flowshop
- memetic algorithm
- release dates
- benchmark problems
- job shop
- parallel computing
- graph model
- single server
- processing times
- shared memory
- metaheuristic
- simulated annealing
- np hard
- feasible solution
- combinatorial optimization