A scheduling problem with three competing agents (Q337134)
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: A scheduling problem with three competing agents |
scientific article; zbMATH DE number 6650712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A scheduling problem with three competing agents |
scientific article; zbMATH DE number 6650712 |
Statements
A scheduling problem with three competing agents (English)
0 references
10 November 2016
0 references
scheduling
0 references
total weighted completion time
0 references
makespan
0 references
multiple-agent
0 references
single-machine
0 references
maintenance activity
0 references
0 references
0 references
0 references
0 references
0 references
0.8650526404380798
0 references
0.8472481966018677
0 references
0.8243730068206787
0 references
0.8222878575325012
0 references
0.8181788921356201
0 references
