A problem of finding an acceptable variant in generalized project networks. Issue 2 (25th July 2005)

• Record Type: Journal Article
• Authors: Blokh, David; Gutin, Gregory; Yeo, Anders
• Is Part Of: Journal of applied mathematics & decision sciences. Volume 2005:Issue 2(2005)
• Page Start: 75
• Page End: 81
• Publication Date: 2005-07-25
• Subjects: Operations research -- Periodicals; Mathematical models -- Periodicals; Statistics -- Periodicals; Quality control -- Periodicals; Mathematical models; Operations research; Quality control; Statistics; Periodicals; 519.05
• DOI: 10.1155/JAMDS.2005.75
• Languages: English
• ISSNs: 1173-9126

Abstract

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.