A Novel Hybrid GA for the Assignment of Jobs to Machines in a Complex Hybrid Flow Shop Problem.
Houda HarbaouiSoulef KhalfallahOdile Bellenguez-MorineauPublished in: ISDA (2017)
Keyphrases
- flowshop
- scheduling problem
- hybrid ga
- special case
- processing times
- flowshop scheduling
- sequence dependent setup times
- total tardiness
- maximum lateness
- setup times
- parallel machines
- minimizing makespan
- flowshop scheduling problems
- makespan minimization
- tabu search
- strongly np hard
- single machine
- unrelated parallel machines
- total weighted tardiness
- asymptotic optimality
- np hard
- genetic algorithm ga
- open shop
- identical parallel machines
- job shop
- lot streaming
- dispatching rule
- identical machines
- job shop scheduling problem
- ant colony optimization
- upper bound
- multi objective