Two‐agent scheduling with linear resource‐dependent processing times (Q6072167)
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 7749646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two‐agent scheduling with linear resource‐dependent processing times |
scientific article; zbMATH DE number 7749646 |
Statements
Two‐agent scheduling with linear resource‐dependent processing times (English)
0 references
12 October 2023
0 references
fully polynomial-time approximation scheme
0 references
proximal bundle algorithm
0 references
resource allocation
0 references
two-agent scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8724151253700256
0 references
0.8522594571113586
0 references
0.8289898633956909
0 references
0.8266535997390747
0 references
0.8250952363014221
0 references
