Quantum Genetic Algorithm for Hybrid Flow Shop Scheduling Problems to Minimize Total Completion Time.
Qun NiuFang ZhouTaijin ZhouPublished in: LSMS/ICSEE (2) (2010)
Keyphrases
- scheduling problem
- minimize total
- single machine
- flowshop
- quantum genetic algorithm
- release dates
- parallel machines
- processing times
- sequence dependent setup times
- precedence constraints
- setup times
- tabu search
- np hard
- job shop
- job shop scheduling problem
- convergence speed
- search algorithm
- feasible solution
- total cost
- genetic algorithm
- single server
- special case