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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-022-00743-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4283446493 / rank | |||
Normal rank | |||
Revision as of 20:12, 19 March 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
