نتایج جستجو برای: project complexity

تعداد نتایج: 555431  

2015
EHSAN POURJAVAD RENE V. MAYORGA

Evaluating project complexity is the main means for successful projects and can play an important role in improving the project management of companies that take on multiple projects simultaneously. Despite the importance of this subject, there are few studies in this field and project managers have not paid a great deal of attention to it. In this paper, an exploratory approach has been taken ...

1967
Solomon Marcus

la lin~uistique al~brique par Solomon Marcus Une caract~ristique du d~veloppement r4cent de la linguistique alg4brique c'est l'existence de maintes th4ories parall~les, ayant pour objet une m~me r4alit~ linguistique ou des fairs assez semblables. Mais pour la plupart de ces th4ories on ne connalt pas les rapports exacts et on continue d'utiliser m~me des terminologies diff~rentes pour des notio...

2012
Xianwei Sun Scott C.-H. Huang Minming Li

In this paper, we study the time complexity of data collection in sensor networks. A simple mathematical model for sensor networks regarded as lines, multi-lines and trees is defined and corresponding optimal schedules are provided. A lower bound of data collection time on general networks is also derived. Furthermore, we discuss the data collection problem where each node can transmit arbitrar...

2008
Sharraf Hussain Shakeel Ahmed Khoja Nazish Hassan Parkash Lohana

This paper presents the effect of ‘schedule compression’ on software project management effort using COCOMO II (Constructive Cost Model II), considering projects which require more than 25 percent of compression in their schedule. At present, COCOMO II provides a cost driver for applying the effect of schedule compression or expansion on project effort. Its maximum allowed compression is 25 per...

Journal: :Management Science 2002
Michael T. Pich Christoph H. Loch Arnoud De Meyer

This article develops a model of a project as a payoff function that depends on the state of the world and the choice of a sequence of actions. A causal mapping, which may be incompletely known by the project team, represents the impact of possible actions on the states of the world. An underlying probability space represents available information about the state of the world. Interactions amon...

2015
Christian Köppe Leo Pruijt

Developing large-scale complex systems in student projects is not common, due to various constraints like available time, student team sizes, or maximal complexity. However, we succeeded to design a project that was of high complexity and comparable to real world projects. The execution of the project and the results were both successful in terms of quality, scope, and student/teacher satisfact...

2004
Nancy L. Martin Kimberly A. Furumo John Michael Pearson

Information systems (IS) projects are ubiquitous in today’s business environment. IS projects vary in size, scope, difficulty and risk-level and combined, these attributes represent a project’s complexity. Previous research has found that most IS projects do not meet budget, schedule and/or quality expectations. In the past, organizations have utilized a variety of project management practices ...

2015
Raymond E. Levitt W. Richard Scott

Megaprojects are very large, complex projects requiring new, and often previously untested, management skills and techniques for their successful implementation. Multibillion-dollar projects have become the norm for many infrastructure and resource extraction facilities worldwide over the last decade. However, increased size and scope do not necessarily transform a large project into a “megapro...

2001
J. P. Lewis

Algorithmic (KCS) complexity results can be interpreted as indicating some limits to software estimation. While these limits are abstract they nevertheless contradict enthusiastic claims occasionally made by commercial software estimation advocates. Specifically, if it is accepted that algorithmic complexity is an appropriate definition of the complexity of a programming project, then claims of...

2001
J. P. Lewis

Algorithmic (KCS) complexity results can be interpreted as indicating some limits to software estimation. While these limits are abstract they nevertheless contradict enthusiastic claims occasionally made by commercial software estimation advocates. Specifically, if it is accepted that algorithmic complexity is an appropriate definition of the complexity of a programming project, then claims of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید