Solving resource-constrained multiple project scheduling problem using timed colored Petri nets (Q615286)
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: Solving resource-constrained multiple project scheduling problem using timed colored Petri nets |
scientific article; zbMATH DE number 5832626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving resource-constrained multiple project scheduling problem using timed colored Petri nets |
scientific article; zbMATH DE number 5832626 |
Statements
Solving resource-constrained multiple project scheduling problem using timed colored Petri nets (English)
0 references
5 January 2011
0 references
timed colored Petri nets
0 references
resource-constrained multiple project scheduling problem (RCMPSP)
0 references
mapping mechanism
0 references
0.7691473364830017
0 references
0.7560838460922241
0 references
0.7524300217628479
0 references
0.7487333416938782
0 references
