Login / Signup
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates.
Gur Mosheiov
Daniel Oron
Dvir Shabtay
Published in:
J. Sched. (2022)
Keyphrases
</>
processing times
scheduling problem
learning algorithm
small number
np complete
fixed number
maximum number