Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop.
Michael AndresenHeidemarie BräselMarc MörigJan TuschFrank WernerPer WilleniusPublished in: Math. Comput. Model. (2008)
Keyphrases
- simulated annealing
- open shop
- job shop
- genetic algorithm
- tabu search
- job shop scheduling problem
- completion times
- approximation algorithms
- metaheuristic
- job shop scheduling
- evolutionary algorithm
- scheduling problem
- flowshop
- hybrid algorithm
- benchmark problems
- genetic algorithm ga
- production scheduling
- combinatorial optimization
- multistage
- solution quality
- optimization method
- search procedure
- parallel machines
- memetic algorithm
- single machine
- single machine scheduling problem
- processing times
- fitness function
- artificial neural networks
- neural network
- weighted sum
- feasible solution
- evolutionary computation
- genetic programming
- optimization problems
- worst case
- np hard
- multi objective