A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times.
Shuaipeng YuanTieke LiBailin WangPublished in: J. Intell. Manuf. (2021)
Keyphrases
- scheduling problem
- differential evolution algorithm
- flowshop
- differential evolution
- evolutionary algorithm
- single machine
- processing times
- sequence dependent setup times
- tabu search
- control parameters
- np hard
- setup times
- total tardiness
- minimizing makespan
- maximum lateness
- flowshop scheduling
- special case
- total flowtime
- job shop scheduling problem
- simulated annealing
- permutation flowshop
- parallel machines
- job shop
- precedence constraints
- genetic algorithm
- completion times
- open shop
- optimization model
- unrelated parallel machines
- lot streaming
- strongly np hard
- traveling salesman problem
- optimization problems
- cost function
- computational complexity
- learning algorithm