A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop.
Safa KhalouliFatima GhedjatiAbdelaziz HamzaouiPublished in: Eng. Appl. Artif. Intell. (2010)
Keyphrases
- scheduling problem
- flowshop
- metaheuristic
- tabu search
- single machine
- strongly np hard
- ant colony optimization
- simulated annealing
- np hard
- setup times
- minimizing makespan
- permutation flowshop
- feasible solution
- processing times
- search space
- total tardiness
- optimization problems
- sequence dependent setup times
- parallel machines
- job shop
- maximum lateness
- optimal solution
- job shop scheduling problem
- combinatorial optimization problems
- genetic algorithm
- vehicle routing problem
- total flowtime
- flowshop scheduling
- harmony search algorithm
- combinatorial optimization
- search procedure
- memetic algorithm
- mixed integer program
- optimization method
- particle swarm optimization
- unrelated parallel machines
- precedence constraints
- mathematical programming
- harmony search
- total weighted tardiness
- release dates
- open shop
- lower bound