A problem of finding an acceptable variant in generalized project networks | Zendy

David Blokh | Zendy; Gregory Gutin | Zendy; Anders Yeo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A problem of finding an acceptable variant in generalized project networks

Author(s) -

David Blokh,

Gregory Gutin,

Anders Yeo

Publication year - 2005

Publication title -

journal of applied mathematics and decision sciences

Language(s) - English

Resource type - Journals

eISSN - 1532-7612

pISSN - 1173-9126

DOI - 10.1155/jamds.2005.75

Subject(s) - mathematical optimization , order (exchange) , computer science , computational problem , computational complexity theory , mathematics , algorithm , finance , economics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research