Minimizing the number of late tasks with error constraint (Q1308984)
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 465565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of late tasks with error constraint |
scientific article; zbMATH DE number 465565 |
Statements
Minimizing the number of late tasks with error constraint (English)
0 references
8 December 1993
0 references
imprecise computation model
0 references
preemptive schedule
0 references
optimal schedule
0 references
NP- hard
0 references
single processor
0 references
pseudo-polynomial time algorithm
0 references
heuristic
0 references
0.8780235052108765
0 references
0.8537376523017883
0 references
0.8482806086540222
0 references
0.8473004698753357
0 references
0.8445830941200256
0 references
