A Greedy heuristic for solving scheduling problems with bounded rejection cost.
Matan AtsmonyGur MosheiovPublished in: Comput. Oper. Res. (2022)
Keyphrases
- greedy heuristic
- scheduling problem
- np hard
- minimum cost
- greedy algorithm
- single machine
- minimum weight
- knapsack problem
- worst case analysis
- optimal solution
- greedy heuristics
- processing times
- tabu search
- set cover
- cost sensitive
- lower bound
- flowshop
- parallel machines
- special case
- high cost
- np complete
- setup times
- job shop scheduling problem
- sequence dependent setup times
- strongly np hard
- machine learning
- search algorithm for solving