New algorithms for minimizing the weighted number of tardy jobs on a single machine.
Danny HermelinShlomo KarhiMichael L. PinedoDvir ShabtayPublished in: Ann. Oper. Res. (2021)
Keyphrases
- data structure
- computational complexity
- small number
- running times
- execution times
- recently developed
- benchmark datasets
- learning algorithm
- space complexity
- scheduling problem
- optimization problems
- computationally efficient
- data mining algorithms
- computational efficiency
- probabilistic model
- memory requirements
- single machine
- maximum number
- nearest neighbour
- computational cost
- computer vision