Gregory Gutin, David Blokh and Anders Yeo (2005) A problem of finding an acceptable variant in generalized project networks. Journal of Applied Mathematics and Decision Sciences, 2005 (2). pp. 75-81. ISSN 1173-9126
Full text access: Open
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.
This is a Published version This version's date is: 01/01/2005 This item is peer reviewed
https://repository.royalholloway.ac.uk/items/4ec9df0a-e14b-c0c4-9955-5142f891fe58/1/
Deposited by () on 03-Feb-2011 in Royal Holloway Research Online.Last modified on 03-Feb-2011
(C) 2005 Hindawi Publishing Corporation whose permission to mount this version for private study and research is acknowledged.