14 citations · 40 across the 11 of their papers we have counts for
1 paper · 1 filter
Hossein Efsandiari, MohammadTaghi Hajiaghyi, Jochen Koenemann +3
We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasibl…