Completion time variance minimization on a single machine is difficult (Q1317023): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(93)90019-d / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993900332 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 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
