An Application Of Effective Genetic Algorithms For Solving Hybrid Flow Shop Scheduling Problems.
Cengiz KahramanOrhan EnginIhsan KayaMustafa Kerim YilmazPublished in: Int. J. Comput. Intell. Syst. (2008)
Keyphrases
- scheduling problem
- flowshop
- tabu search
- single machine
- setup times
- genetic algorithm
- processing times
- np hard
- job shop scheduling
- permutation flowshop
- parallel machines
- job shop scheduling problem
- sequence dependent setup times
- minimizing makespan
- job shop
- precedence constraints
- maximum lateness
- strongly np hard
- makespan minimization
- total tardiness
- flowshop scheduling
- bicriteria
- neural network
- total flowtime
- parallel genetic algorithm
- flowshop scheduling problems
- asymptotic optimality
- evolutionary algorithm
- special case
- unrelated parallel machines
- multi objective
- metaheuristic