Completion time variance minimization on a single machine is difficult (Q1317023): Difference between revisions
From MaRDI portal
Revision as of 12:35, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Completion time variance minimization on a single machine is difficult |
scientific article |
Statements
Completion time variance minimization on a single machine is difficult (English)
0 references
17 April 1994
0 references
NP-completeness
0 references
completion time variance minimization
0 references
single machine
0 references
0 references