Extremal behavior of the Greedy algorithm for a triangle scheduling problem.
János BaloghJózsef BékésiNóra BükiGyörgy DósaZsolt TuzaPublished in: Comput. Oper. Res. (2024)
Keyphrases
- greedy algorithm
- scheduling problem
- permutation flowshop
- total flowtime
- greedy algorithms
- np hard
- set cover
- squeaky wheel
- worst case
- objective function
- greedy strategy
- greedy heuristic
- flowshop
- minimizing makespan
- single machine
- influence maximization
- tabu search
- setup times
- optimization problems
- knapsack problem
- submodular functions
- dynamic programming
- approximation algorithms
- processing times
- approximation guarantees
- evolutionary algorithm
- search algorithm
- reinforcement learning