COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION (Q4698472)
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: COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION |
scientific article; zbMATH DE number 751323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION |
scientific article; zbMATH DE number 751323 |
Statements
COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION (English)
0 references
4 May 1995
0 references
Petri nets
0 references
constraints
0 references
precedence relationships
0 references
multiple resource allocation
0 references
branch-and-bound
0 references
multirobot task scheduling
0 references
0.850974977016449
0 references
0.7947912216186523
0 references
