A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion.
Yuanzhen LiQuan-Ke PanRubén RuizHongyan SangPublished in: Knowl. Based Syst. (2022)
Keyphrases
- greedy algorithm
- total tardiness
- greedy algorithms
- single machine
- scheduling problem
- distributed systems
- greedy strategy
- parallel machines
- dynamic programming
- worst case
- objective function
- set cover
- greedy heuristic
- response time
- setup times
- influence maximization
- influence spread
- knapsack problem
- markov random field
- search algorithm
- web pages