Solving the FMS Scheduling Problem by Critical Ratio-based Heuristics and the Genetic Algorithm.
Tsung-Che ChiangLi-Chen FuPublished in: ICRA (2004)
Keyphrases
- scheduling problem
- genetic algorithm
- tabu search
- greedy heuristics
- search heuristics
- list scheduling
- job shop scheduling problem
- single machine
- setup times
- np hard
- heuristic search
- strongly np hard
- search algorithm
- minimizing makespan
- precedence constraints
- simulated annealing
- processing times
- timetabling problem
- admissible heuristics
- metaheuristic
- flowshop
- simulated annealing and tabu search
- job shop
- hybrid algorithms
- hybrid algorithm
- permutation flowshop
- sequence dependent setup times
- feasible solution
- parallel machines
- hyper heuristics
- memetic algorithm
- control strategies