Unary NP-hardness of minimizing total weighted tardiness with generalized due dates (Q1785477): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.12.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2191379429 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of generalized due date scheduling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine scheduling with assignable due dates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3197606 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4034337 / rank | |||
Normal rank | |||
Latest revision as of 16:49, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unary NP-hardness of minimizing total weighted tardiness with generalized due dates |
scientific article |
Statements
Unary NP-hardness of minimizing total weighted tardiness with generalized due dates (English)
0 references
28 September 2018
0 references
single machine scheduling
0 references
total weighted tardiness
0 references
generalized due dates
0 references
unary NP-hard
0 references
