No label defined (Q3751359)
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 3989090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3989090 |
Statements
1987
0 references
survey
0 references
Complexity results
0 references
approximation algorithms
0 references
worst case behaviors
0 references
computer scheduling
0 references
resource constrains
0 references
microprocessor systems
0 references
bibliography
0 references
0.8368352055549622
0 references
0.8366528749465942
0 references
0.8328825831413269
0 references
[For the entire collection see Zbl 0599.00013.] A survey of recent results in scheduling theory, is presented. Complexity results and approximation algorithms with their worst case behaviors, are described. The choice of the results presented has been motivated by the importance of a particular result and by its relevance to a computer scheduling problem. Special attention is paid to scheduling under resource constrains and scheduling in microprocessor systems. An extensive bibliography completes the survey.
0 references