An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times.
Imma RibasRamón CompanysXavier Tort-MartorellPublished in: Expert Syst. Appl. (2021)
Keyphrases
- greedy algorithm
- sequence dependent setup times
- parallel machines
- single machine
- scheduling problem
- single machine scheduling problem
- greedy algorithms
- dynamic programming
- release dates
- setup times
- worst case
- flowshop
- precedence constraints
- shared memory
- objective function
- influence maximization
- greedy strategy
- lot sizing
- parallel computing
- knapsack problem
- genetic algorithm
- influence spread