An evolutionary algorithm for a hybrid flowshop scheduling problem with consistent sublots.
Xinli ZhangBiao ZhangLeilei MengYaping RenRonghua MengJunqing LiPublished in: Int. J. Autom. Control. (2022)
Keyphrases
- flowshop
- scheduling problem
- evolutionary algorithm
- lot streaming
- minimizing makespan
- tabu search
- multi objective
- single machine
- total flowtime
- optimization problems
- processing times
- sequence dependent setup times
- simulated annealing
- special case
- minimizing total tardiness
- setup times
- bicriteria
- differential evolution
- genetic algorithm
- np hard
- permutation flowshop
- maximum lateness
- total tardiness
- precedence constraints
- flowshop scheduling
- parallel machines
- flowshop scheduling problems
- total weighted tardiness
- job shop scheduling problem
- makespan minimization
- crossover operator
- preventive maintenance
- maximum tardiness
- unrelated parallel machines
- metaheuristic
- search space
- computational complexity