Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483)
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: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures |
scientific article; zbMATH DE number 5720422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling problems with two competing agents to minimize minmax and minsum earliness measures |
scientific article; zbMATH DE number 5720422 |
Statements
Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (English)
0 references
11 June 2010
0 references
multi-agent scheduling
0 references
single machine
0 references
earliness
0 references
0 references
0 references
0.9234111309051514
0 references
0.917761504650116
0 references
0.8710786700248718
0 references
0.8602301478385925
0 references
