Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm.
Carlos Eduardo de AndradeThuener SilvaLuciana S. PessoaPublished in: Expert Syst. Appl. (2019)
Keyphrases
- scheduling problem
- flowshop
- genetic algorithm
- number of tardy jobs
- tabu search
- job shop scheduling problem
- flowshop scheduling
- single machine
- completion times
- setup times
- processing times
- bicriteria
- sequence dependent setup times
- minimizing makespan
- total tardiness
- maximum lateness
- minimizing total tardiness
- maximum tardiness
- total flowtime
- special case
- permutation flowshop
- total weighted tardiness
- precedence constraints
- makespan minimization
- parallel machines
- np hard
- evolutionary algorithm
- flowshop scheduling problems
- job shop
- metaheuristic
- neural network
- ant colony optimization
- multistage
- multi objective
- benchmark problems
- memetic algorithm