A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion.
Vahid RiahiRaymond ChiongYuli ZhangPublished in: Comput. Oper. Res. (2020)
Keyphrases
- total tardiness
- flowshop scheduling
- flowshop
- total flowtime
- scheduling problem
- greedy algorithm
- squeaky wheel
- flowshop scheduling problems
- permutation flowshop
- minimizing makespan
- single machine
- sequence dependent setup times
- setup times
- special case
- parallel machines
- processing times
- tabu search
- np hard
- greedy algorithms
- dynamic programming
- multistage
- worst case
- computational complexity
- set cover
- image segmentation
- influence maximization
- greedy strategy
- response time