A problem of finding an acceptable variant in generalized project networks
type: Item
instance of: scholarly article
title: A problem of finding an acceptable variant in generalized project networks
zbMATH Open document ID: 1165.90654
DOI: 10.1155/JAMDS.2005.75
author: David Blokh
author: G. Gutin
author: A. Yeo
published in: Journal of Applied Mathematics and Decision Sciences
publication date: 2008-07-01T00:00:00Z
full work available at URL: https://eudml.org/doc/130368
review text: Summary: 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.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 5295959
zbMATH Keywords: management
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
OpenAlex ID: W2056215311
description: scientific article; zbMATH DE number 5295959