Flow-shop sequencing using hybrid simulated annealing.
Andreas C. NearchouPublished in: J. Intell. Manuf. (2004)
Keyphrases
- flowshop
- simulated annealing
- tabu search
- scheduling problem
- metaheuristic
- flowshop scheduling
- flowshop scheduling problems
- lot streaming
- evolutionary algorithm
- asymptotic optimality
- genetic algorithm
- special case
- setup times
- processing times
- solution quality
- unrelated parallel machines
- search procedure
- maximum lateness
- open shop
- memetic algorithm
- buffer allocation
- feasible solution
- single machine
- hybrid algorithm
- minimizing makespan
- genetic algorithm ga
- job shop
- combinatorial optimization
- sequence dependent setup times
- simulated annealing algorithm
- job shop scheduling problem
- optimization method
- parallel machines
- ant colony optimization
- initial solution
- sufficient conditions
- optimization problems
- expert systems
- production system
- benchmark problems
- computational complexity
- search algorithm