Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436)
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: Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints |
scientific article |
Statements
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (English)
0 references
2 September 2022
0 references
data mule scheduling
0 references
handling time
0 references
time span constraint
0 references
approximation algorithms
0 references
polynomial algorithms
0 references
0 references
0 references
0 references
0 references
