This dissertation examines a profit-maximizing project selection and scheduling problem. Assume that a set of potentially profitable projects are available, yet limited available resources may not allow all of them to be pursued. Profit profiles for projects are assumed to be non-increasing functions of project completion times, i.e. profit returns are sensitive to time-to-market. Decision need...

In this paper, we propose a static scheduling algorithm for allocating task graphs to fullyconnected multiprocessors. We discuss six recently reported scheduling algorithms and show that they possess one drawback or the other which can lead to poor performance. The proposed algorithm, which is called the Dynamic Critical-Path (DCP) scheduling algorithm, is different from the previously proposed...

Practitioners are typically aware that organisational complexity is important to IT project performance however they are unsure of exactly what it comprises and how they should take it into account in their decision-making. This paper contributes to addressing the ‘what’ question by taking a multi-level conflict approach to understanding the relationship between individuals, groups and IT proje...

this study examined the effects of task complexity on written narrative production under different task complexity conditions by efl learners at different proficiency levels. task complexity was manipulated along robinson’s (2001b) proposed task complexity dimension of here-and-now (simple) vs. there-and-then (complex) in. accordingly, three specific measures of the written narratives were targ...

Complexity, understood as the interconnectedness of things, poses a constant challenge to organisations. Organisations may be unable to identify and manage their multiple human, technological or organisational interfaces or the interplay of different technological components. Also, organisations may have incomplete information about the true intent of some players or the dynamics of the market ...