An iterated greedy algorithm for distributed flowshops with tardiness and rejection costs to maximize total profit.
Zhen LinXue-Lei JingBaoxian JiaPublished in: Expert Syst. Appl. (2023)
Keyphrases
- greedy algorithm
- expected profit
- total flowtime
- scheduling problem
- greedy algorithms
- dynamic programming
- greedy strategy
- set cover
- single machine
- total weighted tardiness
- greedy heuristic
- influence maximization
- permutation flowshop
- worst case
- minimizing makespan
- knapsack problem
- sequence dependent setup times
- processing times
- parallel machines
- total cost
- tabu search
- np hard