The optimum with the shortest total processing time of on-time jobs (Q3404886)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5670950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The optimum with the shortest total processing time of on-time jobs |
scientific article; zbMATH DE number 5670950 |
Statements
12 February 2010
0 references
scheduling
0 references
tardy
0 references
polynomial time algorithm
0 references
complexity
0 references
0.8921129703521729
0 references
0.8110942244529724
0 references
0.8097327351570129
0 references
0.8056306838989258
0 references
