Scheduling two competing agents when one agent has significantly fewer jobs (Q5363760)
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 6784958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling two competing agents when one agent has significantly fewer jobs |
scientific article; zbMATH DE number 6784958 |
Statements
29 September 2017
0 references
parameterized complexity
0 references
multiagent scheduling
0 references
Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs (English)
0 references
0.862561047077179
0 references
0.8542121648788452
0 references
0.8485056757926941
0 references
0.8479786515235901
0 references
0.8464820981025696
0 references
