An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem.
Imma RibasRamón CompanysXavier Tort-MartorellPublished in: Expert Syst. Appl. (2019)
Keyphrases
- greedy algorithm
- total tardiness
- parallel machines
- greedy algorithms
- single machine
- scheduling problem
- worst case
- knapsack problem
- dynamic programming
- greedy strategy
- set cover
- objective function
- sequence dependent setup times
- shared memory
- setup times
- parallel computing
- scheduling algorithm
- integer program
- combinatorial optimization
- influence maximization
- linear programming
- search space