2 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Danny Hermelin, Shlomo Karhi, Mike Pinedo +1
In this paper we study the classical single machine scheduling problem where the objective is to minimize the total weight of tardy jobs. Our analysis focuses on the case where one…