Pareto-scheduling of two competing agents with their own equal processing times (Q2140187)
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 7529750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pareto-scheduling of two competing agents with their own equal processing times |
scientific article; zbMATH DE number 7529750 |
Statements
Pareto-scheduling of two competing agents with their own equal processing times (English)
0 references
20 May 2022
0 references
scheduling
0 references
single machine
0 references
Pareto frontier
0 references
two-agent
0 references
own equal processing times
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8530168533325195
0 references
0.8466070294380188
0 references
0.8431749939918518
0 references
0.8413497805595398
0 references
0.8325628042221069
0 references
