On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates |
scientific article |
Statements
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (English)
0 references
4 November 2022
0 references
scheduling
0 references
single machine
0 references
generalized due-dates
0 references
\(\mathcal{NP}\)-hard
0 references
pseudo-polynomial time algorithm
0 references
parameterized complexity
0 references
