On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates |
scientific article; zbMATH DE number 7612462
| 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; zbMATH DE number 7612462 |
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
0 references
