Single machine scheduling with two competing agents and equal job processing times (Q319290)
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: Single machine scheduling with two competing agents and equal job processing times |
scientific article; zbMATH DE number 6633489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine scheduling with two competing agents and equal job processing times |
scientific article; zbMATH DE number 6633489 |
Statements
Single machine scheduling with two competing agents and equal job processing times (English)
0 references
6 October 2016
0 references
single machine scheduling
0 references
two competing agents
0 references
equal processing times
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.95207596
0 references
0.9469859
0 references
0.9350109
0 references
0.93379104
0 references
0.92327625
0 references
0.9218688
0 references
0.92154706
0 references
0 references
