C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On the parameterized tractability of single machine scheduling with rejection.
Danny Hermelin
Michael L. Pinedo
Dvir Shabtay
Nimrod Talmon
Published in:
Eur. J. Oper. Res. (2019)
Keyphrases
</>
deteriorating jobs
constraint satisfaction
computational complexity
np complete
processing times
precedence constraints
database systems
special case
dynamic programming
probabilistic model