Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pseudopolynomial algorithms for CTV minimization in single machine scheduling |
scientific article; zbMATH DE number 1083957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudopolynomial algorithms for CTV minimization in single machine scheduling |
scientific article; zbMATH DE number 1083957 |
Statements
Pseudopolynomial algorithms for CTV minimization in single machine scheduling (English)
0 references
6 November 1997
0 references
single machine
0 references
completion time variance
0 references
dominance criteria
0 references
pseudopolynomial algorithm
0 references
0 references
0 references
0.8718858361244202
0 references
0.8354434370994568
0 references
0.8309598565101624
0 references
