In this paper, we consider a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT networks for project management, in which all activities are subjected to a linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined probability such that the required additional cost is min...

In the present paper, Characteristics of fuzzy project network using statistical data are discussed in detail in order to calculate the fuzzy critical path, fuzzy earliest times, fuzzy latest times and fuzzy total float. Fuzzy number as fuzzy activity time is constructed using interval estimate by calculating mean, variance and standard error. A new ranking function is used to discriminate the ...

Critical Path method (CPM) is widely used in project scheduling and controlling. In conventional project scheduling problem, the crisp numbers are used for the activity times. But in reality, in an imprecise and uncertain environment, it is an unrealistic assumption. To represent the uncertainty involved we have considered the interval-valued numbers to represent the activity times. In this pap...

In the last decade, theory of constraint application in project management lead to make a new approach for project scheduling and control as a critical chain. In this paper, a multi-objective optimization model for multi-project scheduling on critical chain is investigated. The objectives include time, cost and quality. In order to solve the problem, a Simulated Annealing algorithm is developed...

The Critical Path Method (CPM) is useful for planning and control of complex projects. The CPM identifies the critical activities in the critical path of an activity network. The successful implementation of CPM requires the availability of clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfill since many of activities will...

Multi-processor scheduling is an NP-hard problem, so heuristic solutions must be found. Several critical path heuristics have been proposed, but these must be empirically tested to see if their solutions are adequate. This paper examines the performance of four critical path heuristics and nds that they are unable to perform well on the types of graphs which are likely to be created by compiler...