Journal of Applied Mathematics and Decision Sciences 
Volume 2005 (2005), Issue 2, Pages 75-81
doi:10.1155/JAMDS.2005.75

A problem of finding an acceptable variant in generalized project networks

David Blokh,1 Gregory Gutin,2 and Anders Yeo2

 1Department of Physics, Bar-Ilan University, Ramat Gan 52900, Israel
2Department of Computer Science, Royal Holloway University of London, Egham Surrey TW20 0EX, UK
Received 20 January 2003; Revised 20 June 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.