A resource allocation problem on timed marked graphs: a decomposition approach (Q4883825)
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 resource allocation problem on timed marked graphs: a decomposition approach |
scientific article; zbMATH DE number 896166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A resource allocation problem on timed marked graphs: a decomposition approach |
scientific article; zbMATH DE number 896166 |
Statements
A resource allocation problem on timed marked graphs: a decomposition approach (English)
0 references
7 November 1996
0 references
discrete event dynamic systems
0 references
timed marked graph
0 references
binary search procedure
0 references
error bounds
0 references
jobshop
0 references
0.8536377549171448
0 references
0.7879855036735535
0 references
