An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014)
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: An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times |
scientific article; zbMATH DE number 5703325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times |
scientific article; zbMATH DE number 5703325 |
Statements
An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (English)
0 references
3 May 2010
0 references
competitive analysis
0 references
0 references
0 references
0 references
0 references
0.8441482186317444
0 references
0.8441482186317444
0 references
0.8413569927215576
0 references
0.8411241769790649
0 references
0.8384073972702026
0 references
