A problem of finding an acceptable variant in generalized project networks (Q930769)
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 problem of finding an acceptable variant in generalized project networks |
scientific article; zbMATH DE number 5295959
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A problem of finding an acceptable variant in generalized project networks |
scientific article; zbMATH DE number 5295959 |
Statements
A problem of finding an acceptable variant in generalized project networks (English)
0 references
1 July 2008
0 references
Summary: A project network often has some activities or groups of activities which can be performed at different stages of the project. Then, the problem of finding an optimal/acceptable time or/and optimal/acceptable order of such an activity or a group of activities arises. Such a problem emerges, in particular, in house-building management when the beginnings of some activities may vary in time or/and order. We consider a mathematical formulation of the problem, show its computational complexity, and describe an algorithm for solving the problem.
0 references
management
0 references
computational complexity
0 references
