A new approach for solving flow shop scheduling problems with generalized intuitionistic fuzzy numbers.
T. YogashanthiS. MohanaselviK. GanesanPublished in: J. Intell. Fuzzy Syst. (2019)
Keyphrases
- scheduling problem
- flowshop
- processing times
- setup times
- minimizing makespan
- tabu search
- single machine
- special case
- parallel machines
- sequence dependent setup times
- job shop
- strongly np hard
- flowshop scheduling
- np hard
- total tardiness
- precedence constraints
- bicriteria
- total flowtime
- job shop scheduling problem
- makespan minimization
- job shop scheduling
- total weighted tardiness
- asymptotic optimality
- flowshop scheduling problems
- permutation flowshop
- maximum lateness
- release dates
- memetic algorithm
- evolutionary algorithm
- lower bound
- computational complexity
- neural network