On the complexity of scheduling tasks with discrete starting times (Q1195868)
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: On the complexity of scheduling tasks with discrete starting times |
scientific article; zbMATH DE number 86094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of scheduling tasks with discrete starting times |
scientific article; zbMATH DE number 86094 |
Statements
On the complexity of scheduling tasks with discrete starting times (English)
0 references
4 January 1993
0 references
discrete starting times
0 references
single processor
0 references
NP-complete
0 references
polynomially solvable case
0 references
0.9868089
0 references
0.92197645
0 references
0.89692694
0 references
0.8930812
0 references
0.88559604
0 references
0.8833755
0 references
0.8813113
0 references
0.8783381
0 references
0 references
