Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774)
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: Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing |
scientific article; zbMATH DE number 7576506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing |
scientific article; zbMATH DE number 7576506 |
Statements
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (English)
0 references
26 August 2022
0 references
multiprocessor scheduling
0 references
scheduling with testing
0 references
non-preemptive
0 references
makespan
0 references
competitive ratio
0 references
approximation algorithm
0 references
0.9757134
0 references
0.88326746
0 references
0.87868655
0 references
0.87868655
0 references
0.87361985
0 references
0.87050027
0 references
