Advances in Decision Sciences

Advances in Decision Sciences / 2005 / Article
Special Issue

Combinatorial Optimization

View this Special Issue

Open Access

Volume 2005 |Article ID 630214 | https://doi.org/10.1155/JAMDS.2005.75

David Blokh, Gregory Gutin, Anders Yeo, "A problem of finding an acceptable variant in generalized project networks", Advances in Decision Sciences, vol. 2005, Article ID 630214, 7 pages, 2005. https://doi.org/10.1155/JAMDS.2005.75

A problem of finding an acceptable variant in generalized project networks

Received20 Jan 2003
Revised20 Jun 2003

Abstract

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.

Copyright © 2005 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

107 Views | 250 Downloads | 0 Citations
 PDF Download Citation Citation
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.