Bounds for the position of the smallest job in completion time variance minimization (Q1296376): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q127976795, #quickstatements; #temporary_batch_1722798197196 |
||
| (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/s0377-2217(98)00002-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087418334 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127976795 / rank | |||
Normal rank | |||
Latest revision as of 21:04, 4 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds for the position of the smallest job in completion time variance minimization |
scientific article |
Statements
Bounds for the position of the smallest job in completion time variance minimization (English)
0 references
2 August 1999
0 references
single-machine scheduling
0 references
completion time variance
0 references
heuristic procedure
0 references
0 references
