Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search.
Antoine JougletCeyda OguzMarc SevauxPublished in: J. Math. Model. Algorithms (2009)
Keyphrases
- memetic algorithm
- efficient search
- scheduling problem
- tabu search
- flowshop
- job shop
- job shop scheduling problem
- sequence dependent setup times
- setup times
- unrelated parallel machines
- maximum lateness
- processing times
- single machine
- similarity search
- job shop scheduling
- np hard
- parallel machines
- precedence constraints
- vehicle routing problem
- feasible solution
- test problems
- evolutionary computation
- release dates
- simulated annealing
- metaheuristic
- genetic algorithm
- search problems
- production scheduling
- manufacturing cell
- constraint satisfaction
- crossover operator
- completion times
- state space
- np complete
- constraint satisfaction problems
- artificial neural networks
- high dimensional
- reinforcement learning