SlideShare ist ein Scribd-Unternehmen logo
1 von 14
Downloaden Sie, um offline zu lesen
Mathematical Theory and Modeling                                                                      www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012




    Fully Fuzzy Time-Cost Trade-Off in a Project Network - A New
                             Approach
                                                  Shakeela Sathish
                                            Department of Mathematics,
                             Faculty of Engineering and Technology, SRM University,
                                   Ramapuram Campus, Chennai - 600 091, India
                        Email: shakeela.s@rmp.srmuniv.ac.in,shakeela_sathish@yahoo.co.in


                                                     K. Ganesan
                                            Department of Mathematics,
                             Faculty of Engineering and Technology, SRM University,
                                      Kattankulathur, Chennai - 603203, India
                            Email: ganesan.k@ktr.srmuniv.ac.in ,gansan_k@yahoo.com



Abstract
In this paper, we propose a new approach to Fuzzy network crashing in a project network whose activity times are
uncertain. The uncertain parameters in the project network are represented by triangular fuzzy numbers. By using a
new type of fuzzy arithmetic and a fuzzy ranking method we propose a method for finding an optimal duration by
crashing the fuzzy activities of a project network without converting the fuzzy activity times to classical numbers. A
numerical example is provided to illustrate the proposed method.
Keywords: Triangular fuzzy number, fuzzy ranking, fuzzy project network, Critical path, crashing.
 1. Introduction
Project management involves project scheduling, planning, evaluating, and controlling. Activity networks have
proven very useful for the performance evaluation of certain types of projects. The critical path method is an
important tool to identify the critical activities in the critical path of an activity network for project management.
Project crashing is a technique used to shorten the project duration by accelerating some of its activities at an
additional expense. The objective of crashing is to reduce project duration while minimizing the cost, which is also
known as time-cost trade off problem. Reducing project durations can be done by providing additional resources to
those activities in the critical path. Project managers are intended to spend the minimum possible amount of money
and achieve the maximum crashing time, as a result both direct and indirect costs will be influenced in the project.
While crashing any critical activity by providing extra resources the direct cost will increase whereas the indirect
cost will reduce and vice versa. Therefore there is some compromise in project duration – a balance between
excessive direct costs for shortening the project duration and excessive indirect costs for lengthening the project
duration which we call as optimum project duration.
The successful implementation of CPM requires the exact values on activity durations, resources, money etc.
However in reality, due to the non availability and uncertainty of information as well as the variation of management
scenario, it is often difficult to obtain the exact values of the decision parameters of the problems. Thus, the
conventional approaches, both deterministic and random process, tend to be less effective in conveying the
imprecision or vagueness nature of the linguistic assessment. Consequently, the fuzzy set theory can play a
significant role in this kind of decision making environment to tackle the unknown or the vagueness about the

                                                         53
Mathematical Theory and Modeling                                                                         www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


decision parameters in a project network.
The fuzzy PERT was originated by Chanas and Kamburowski [3]. Motivated by this article several authors have
studied the fuzzy crashing of fuzzy PERT problem. Steve and DessoukyError! Reference source not found.
described a procedure for solving the project time/cost tradeoff problem of reducing project duration at a minimum
cost. Rehab and Carr Error! Reference source not found. described the typical approach that construction planners
take in performing time-Cost Trade-off (TCT). Pulat and Horn Error! Reference source not found. described a
project network with a set of tasks to be completed according to some precedence relationship; the objective is to
determine efficient project schedules for a range of project realization times and resource cost per time unit for each
resource. Van SlykeError! Reference source not found. demonstrated several advantages of applying simulation
techniques to PERT, including more accurate estimates of the true project length, flexibility in selecting any
distribution for activity times and the ability to calculate “criticality indexes”, which are the probability of various
activities being on the critical path. Van Slyke was the first to apply Monte Carlo simulations to PERT.
Coskun[3]formulated the problem as a Chance Constrained Linear Programming. Johnson and Schon [7] used
simulation to compare three rules for crashing stochastic networks. Badiru[1]reported development of another
simulation program for project management called STARC. Feng et al [5] presented a hybrid approach that combines
simulation techniques with a genetic algorithm to solve the time-cost trade-off problem under uncertainty.
In this paper, we use triangular fuzzy numbers to effectively deal with the ambiguities involved in the process of
linguistic values. Applying a new type of fuzzy arithmetic and a fuzzy ranking method [8,9], we propose a method
for finding an optimal duration by crashing the fuzzy activities of a project network without converting the fuzzy
activity times to classical numbers. A numerical example is provided to illustrate the proposed method. The rest of
this paper is organized as follows. In section 2 we recall the basic concepts of fuzzy numbers, fuzzy arithmetic and
their rankings. In section 3, we introduce the concept of fuzzy network crashing. In section 4, a numerical example is
given to illustrate the method proposed in this paper.
2. Preliminaries
The aim of this section is to present some notations, notions and results which are of useful in our further study.
Definition 2.1
              %
A fuzzy set a defined on the set of real numbers R is said to be a fuzzy number if its membership function
 a : R → [0,1] has the following study.
 %
               %
         (a) a is convex,

           a {λx1 +(1-t)x 2 } =min {a(x1 ),a(x 2 )} , for all x1 , x 2 ∈ R and λ ∈ [0,1]
           %                        %      %


         (b)   %
               a is normal i.e. there exists an         x ∈ R such that a ( x ) = 1
                                                                        %

         (c)   %
               a is Piecewise continuous.
 Definition 2.2
                   %
 A fuzzy number a on R is said to be a triangular fuzzy number (TFN) or linear fuzzy number if its membership
function a% : R → [0,1] has the following characteristics:


         x - a1
         a - a , for a1 ≤ x ≤ a 2
         2 1
         a -x
a (x) =  3
%                 , for a 2 ≤ x ≤ a 3
         a3 - a2
               0, elsewhere
        
        

                                                                   54
Mathematical Theory and Modeling                                                                                       www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


We denote this triangular fuzzy number by             %
                                                      a = (a1 , a 2 , a 3 ). We use F(R) to denote the set of all triangular
fuzzy numbers.




Also if m = a 2 represents the modal value or midpoint, α = ( a 2 − a1 ) represents the left spread and β = (a 3 − a 2 )
represents the right spread of the triangular fuzzy number            %
                                                                      a = (a1 , a 2 , a 3 ),                                    %
                                                                                               then the triangular fuzzy number a

can be represented by the triplet a = ( α,m,β ) . i.e. a = (a1 , a 2 , a 3 ) = ( α, m, β ) .
                                  %                    %


Definition 2.3 A triangular fuzzy number a ∈ F(R) can also be represented as a pair a = ( a, a ) of functions
                                         %                                          %


a ( r ) and a ( r ) for   0 ≤ r ≤ 1 which satisfies the following requirements:


      (i).   a ( r ) is a bounded monotonic increasing left continuous function.


      (ii). a ( r ) is a bounded monotonic decreasing left continuous function.


      (iii). a ( r ) ≤ a ( r ) , 0 ≤ r ≤ 1

                                                                                                        a(1) + a(1) 
Definition 2.4      For an arbitrary triangular fuzzy number a = ( a ,a ) , the number a 0 = 
                                                             %                                                        is said to be a
                                                                                                             2      

location index number of a . The two non-decreasing left continuous functions a * = (a 0 − a),
                         %                                                                                        a * = (a − a 0 ) are

called the left fuzziness index function and the right fuzziness index function respectively.               Hence every triangular

                                                                       (
fuzzy number a = (a1 , a 2 , a 3 ) can also be represented by a = a 0 , a * , a *
             %                                                %                      )
2.1 Ranking of triangular Fuzzy Numbers
Many different approaches for the ranking of fuzzy numbers have been proposed in the literature. Abbasbandy and
Hajjari [1] proposed a new ranking method based on the left and the right spreads at some α -levels of fuzzy
numbers.

                                         %                              (            )                             (
For an arbitrary triangular fuzzy number a = (a1 , a 2 , a 3 ) = a 0 , a * , a * with parametric form a = a(r), a(r) , we
                                                                                                      %                        )

                                                                 55
Mathematical Theory and Modeling                                                                                             www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


                                                    %
define the magnitude of the triangular fuzzy number a by


                                                     1 1                          
                                             Mag(a) =  ∫ ( a + a + a 0 ) f (r) dr 
                                                 %
                                                     2 0                          
                                                     1 1 ∗                                      where     the   function     f (r) is   a
                                                    =  ∫ ( a + 4a 0 − a ∗ ) f (r) dr  .
                                                     2 0                                        non-negative and increasing function
                                                 1 1
on [0,1] with f (0) = 0, f (1) = 1 and ∫ f (r) dr = . The function f (r) can be considered as a weighting function.
                                        0          2
In real life applications, f (r) can be chosen by the decision maker according to the situation. In this paper, for
convenience we use f (r) = r .

                a ∗ + 4a 0 − a ∗   a + a + a 0                
Hence Mag(a) = 
          %                       =                            .
                        4                 4                     
                                                              
                                           %
The magnitude of a triangular fuzzy number a synthetically reflects the information on every membership degree,
                                                           %                                                  %
and meaning of this magnitude is visual and natural. Mag ( a ) is used to rank fuzzy numbers. The larger Mag( a ),
the larger fuzzy number.

                                     %                   (   %        )            (        )
For any two triangular fuzzy numbers a = a 0 , a * , a * and b = b 0 , b* , b* in F(R), we define the ranking of a and
                                                                                                                 %

%                        %             %
b by comparing the Mag ( a ) and Mag ( b ) on R as follows:


         % %                       %
    (i). a f b if and only if Mag( a ) ≥                      %
                                                         Mag( b )


    (ii).    % %                       %          %
             a p b if and only if Mag( a ) ≤ Mag( b )


    (iii).   % %                                  %
             a ≈ b if and only if Mag( a ) = Mag( b )
                                       %

Definition 2.5

                                     (
A triangular fuzzy number a = a 0 , a * , a *
                          %                          )       is said to be symmetric if and only if a * = a * .

Definition 2.6
                                 (               )
A triangular fuzzy number a = a 0 , a * , a * is said to be non-negative if and only if Mag ( a ) ≥ 0 and is denoted by
                          %                                                                   %
% %                                                          (            )
a f 0. Further if Mag( a ) > 0, then a = a 0 , a * , a * is said to be a positive fuzzy number and is denoted by
                        %                      %
% %
af 0 .
Definition 2.7

                                             (       %        )               (        )
Two triangular fuzzy numbers a = a 0 , a * , a * and b = b 0 , b* , b* in F(R) are said to be equivalent if and only if
                             %


     %          %
Mag( a ) = Mag( b ).That is                  % %                                  %
                                             a ≈ b if and only if Mag( a ) = Mag( b ).Two triangular fuzzy numbers
                                                                       %


     (         )        %  (             )
a = a 0 , a * , a * and b = b0 , b* , b* in F(R) are said to be equal if and only if a 0 = b0 , a * = b* , a * = b* . That is
%


                                                                              56
Mathematical Theory and Modeling                                                                                                              www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012



% %
a = b if and only if a 0 = b0 , a * = b* , a * = b* .

2.2 Arithmetic operations on triangular Fuzzy Numbers
Ming Ma et al. [9] have proposed a new fuzzy arithmetic based upon both location index and fuzziness index
functions. The location index number is taken in the ordinary arithmetic, whereas the fuzziness index functions are
considered to follow the lattice rule which is least upper bound in the lattice L. That is for a, b∈L we define

 a ∨ b = max {a, b} and a ∧ b = min {a, b} .


For arbitrary triangular fuzzy numbers a = a 0 , a * , a *
                                       %                      (             )           %       (
                                                                                    and b = b0 , b* , b*   )       and ∗ = {+, −, ×, ÷} , the arithmetic


operations on the triangular fuzzy numbers are defined by                           % %     (                                    )
                                                                                    a ∗ b = a 0 ∗ b0 , a * ∨ b* , a * ∨ b* . In particular for any two


                                      (
triangular fuzzy numbers a = a 0 , a * , a *
                         %                          )       %     (                  )
                                                        and b = b0 , b* , b* , we define


                                  (             ) (               ) (
    (i) Addition: a + b = a 0 , a * , a * + b0 , b* , b* = a 0 + b0 , max {a * , b* } , max a * , b*
                  % %                                                                                          {           })
                                      (             ) (               ) (
    (ii) Subtraction: a − b = a 0 , a * , a * − b 0 , b* , b* = a 0 − b 0 , max {a * , b* } , max a * , b* .
                      % %                                                                                          {        })
                                          (             ) (               ) (                         { })
    (iii) Multiplication: a × b = a 0 , a * , a * × b 0 , b* , b* = a 0 × b 0 , max {a * , b* } , max a * , b* .
                          % %

                   % %        (
    (iv) Division: a ÷ b = a 0 , a * , a *    ) ÷ ( b , b , b ) = ( a ÷ b , max {a , b } , max {a , b }) .
                                                    0     *
                                                              *
                                                                      0         0          *        *
                                                                                                               *       *


3. Fuzzy Crashing
Fuzzy project network is an acyclic digraph, where the vertices represent events, and the directed edges represent the
activities, to be performed in a project. We denote this fuzzy project network by N = (V, A, T ) . Let
                                                                                                     %     % % %
 %                                                                     %        %
V = {v1 ,v2 ,v3 ,...,vn } be the set of fuzzy vertices (events), where v1 and vn are the tail and head events of the
      % % %           %
                             %                                 %     %         %    % × %
project, and each v1 belongs to some path from v1 to vn . Let A ∈ (V 鬃 V) be the set of directed
edges A    {  % ij      %i % j    %i % j        }
        % = a = ( v ,v ) / for v ,v ∈ V , that represents the activities to be performed in the project. Activity a
                                          %                                                                           % ij
                                                                         %                  %                      %
is then represented by one, and only one, arrow with a tail event vi and a head event v j . For each activity aij , a
                    t      %
fuzzy number %ij ∈ T is defined as the fuzzy time required for the completion of aij . A critical path is a longest path
                                                                                     %
                               %                      %                                         %
from the initial event v1 to the terminal event vn of the project network, and an activity aij on a critical path is
called a critical activity.
Most of the existing time-cost trade-off models rely on conditions where the activity time-cost relationships are
assumed to be deterministic. A typical activity time - cost relationship is shown in Fig. 1.                                         However, during project
implementation, many uncertain factors, such as weather, productivity level, human factors etc., dynamically affect
activity durations and costs. The activity time-cost relationship is no longer a monotonously decreasing curve as
shown in Fig. 1. In this paper durations and costs are both characterized by triangular fuzzy numbers and the fuzzy
relationship between time and cost is shown in Fig. 2.




                                                                            57
Mathematical Theory and Modeling                                                                      www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012




                     Figure 1    Deterministic relationship between time and cost of an active




                        Figure 2    Fuzzy relationship between time and cost of an activity

3.1 Notations
  %
  aij :         Project’s activities, where, i = (1, 2, 3,…, n)
  ~
  B:            Maximum available budget
  ~
  T:            Shortest possible duration to complete the project at least cost within the maximum available budget
  ~
  F:            The desired project completion time at least cost
  ~
  T N, I; :     Normal time for activity i
  ~
  T C , I;      Crash time for activity i
  ~
  C N, I;       Normal cost for activity i
  ~
  C C , I:      Crash cost for activity i
  ~
  U i:          Cost slope for activity i
  ~
  C P:          Critical path (longest path in the project network)
  ~
  D N, q:       Normal time for critical activity q,   where q = (1, 2, 3,…, L)
  ~
  D C, q:       Crash time for critical activity q
  ~
  C N, j:       Normal cost for noncritical activity j, where j = (1, 2, 3,…, m)
  ~
  C C , q:      Crash cost for critical activity q

                                                            58
Mathematical Theory and Modeling                                                                                www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012

  ~
  U S:             Cost slope for critical activity S, where S begin with critical activity that has the smallest cost slope
                   = (1, 2, 3,…, Y)
  ~
  U x:             Cost slope for noncritical activity x, where x begin with noncritical activity that has the biggest cost
                   slope = (1, 2, 3,…, z)
  ~
  D r, S:          Max reduction in duration for critical activity S

  TC N :           Total cost to complete the project in normal condition

  TC a:            Total cost to complete the project by crashing all activities (crash condition)

  TC C:            Total cost to complete the project by CCA

  TE C:            Extra cost that adding to crash critical activities

  θCrashForT:      Number of steps to meet F (considering F>T) or obtain T (considering F = T) by CCA

  CCA:             Approach of crashing critical activities


3.2 General descriptions and formulations
            Critical path of the project network in normal condition:
                                              L
                                 CP k = ∑ D N,q                                                           (1)
                                          q =1

            Total cost of the project in normal condition:
                                          n
                               TC N = ∑ C N,2                                                            ( 2)
                                        i =1

            Total cost of the project by crashing all activities:
                                         n
                               TCa = ∑ Cc,i                                                              ( 3)
                                        i =1

            Critical path of the project network by crashing all activities:
                                          L
                               C PC = ∑ D c,q                                                            (4)
                                        q =1

            Total extra cost that adding to crash critical activities:
                                        Y
                               TE t = ∑ D r,s U s                                                        (5)
                                       S =1

            Total cost of the project by CCA:

                               TCC = TC N + TC E                                                         (6)
            Number of steps to meet F (considering F>T) or complete the project within T
            (considering F = T) by CCA:
                                                  Y
                                θCrash Fort = ∑ D r, s                                                    (7)
                                                  s =1




3.3 Algorithm

                                                                59
Mathematical Theory and Modeling                                                                     www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012




 Step1: Draw the project network
 Step2: Determine the normal time and normal cost for each activity to determine the critical and
        noncritical activities
 Step3:     Compute the normal total cost and normal duration of the project completion. If F equals
           the normal duration of completion then we stop the procedure
 Step 4 : Find the project cost by the formula
          Project cost = (Direct cost + (Indirect cost*project duration))
 Step 5 : Find the minimum cost slope by the formula
          Cost slope = (Crash cost - Normal cost)/(Normal time - Crash time)
 Step 6 : Determine the crash time and crash cost for each activity to compute the cost slope
 Step 7 : Identify the activity with the minimum cost slope and crash that activity. Identify the new
          critical path and find the cost of the project by formula
          Project Cost= ((Project Direct Cost + Crashing cost of crashed activity)
                         + Indirect Cost*project duration))
 Step 8 : Crash all activities in the project simultaneously
 Step 9 : Draw the project network after crashing all activities
 Step10 : Determine the critical path and noncritical paths Also, identify the critical activities
 Step11: In the In the new Critical path select the activity with the next minimum cost slope, and
         repeat this step until all the activities along the critical path are crashed upto desired time.
 Step12: At this point all the activities are crashed and further crashing is not possible. The crashing
         of non critical activities does not alter the project duration time and is of no use.


 4. Numerical Example
A precedence relationships network of a project with nine activities is depicted in the diagram. The crash time and
normal time of an activity are triangular fuzzy numbers and crash cost rate and normal cost rate also are triangular
fuzzy numbers (as shown in Table 1).




                                                        60
Mathematical Theory and Modeling                                                                                www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


                                                                       %
Table 1 Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = (a1 , a 2 , a 3 )
                                            Fuzzy duration/d                          Fuzzy cost rate/104 yuan d-1
Activity
                Activity name          Min. crash     Min. normal        Crash cost         Normal cost              Indirect
 index
                                        Duration        Duration            rate               Rate                  cost rate
  1-2       Material preparing         (28,30,32)      (31,32,33)      (1.7,1.9,2. 1)      (0.3,0.35,0.4)      (0.1, 0.12, 0. 14)
            JP3Self-making
  1-3                                  (20,23,26)      (24,26,28)       (1.9,2.0,2.1)      (0.6,0.65,0.7)       (0.18,0.20,0.22)
            omponents
  1-4       The cell manufacture       (15,19,23)      (19,20,21)       (1.7,1.8,1.9)     (0.45,0.55,0.65)      (0.14,0.17,0.2)
            Pipi-parts
  2-5                                  (10,14,18)      (16,18,20)      (1.5,1.55,1.6)      (0.5,0.55,0.6)       (0.15,0.17,0.19)
            manufacture
  5-8       Parts assembly             (17,20,23)      (19,21,23)      (1.8,1.85,1.9)       (0.4,0.5,0.6)       (0. 14,0. 17,0.2)

  3-6       Block building             (10,13,16)      (14,15,16)      (2.0,2. 1,2.2)      (0.55,0.6,0.65)     (0.15,0. 17,0. 19)

  6-8       Pallet assembly             (8 ,11,14)     (13,14,15)      (1.4,1.45,1.5)      (0.4,0.45,0.55)     (0. 13,0. 15,0. 17)

  4-7       Sections building          (16,19,22)      (21,23,25)       (1.9,2.0,2.1)       (0.6,0.7,0.8)       (0.18,0.20,0.22)

  7-9       Zone construction          (10,12,14)      (13,14,15)       (2.3,2.4,2.5)      (0.7,0.75,0.8)       (0.19,0.21,0.23)

            Building berth
  8-9                                    (4,5,6)         (5,6,7)        (2.4,2.5,2.6)      (0.8,0.85,0.9)       (0.2,0.23,0.26)
            healing


                                                                                         %
Here all the decision parameters are triangular fuzzy numbers represented in the form of a = (a1 , a 2 , a 3 ) .
According to Definition 2.4 these triangular fuzzy numbers can also be represented in a convenient form
                    (         )
 a = (a1 , a 2 , a 3 ) = a 0 , a * , a * , where a 0 - location index number, a * = (a 0 − a) - left fuzziness index function and
 %
                                                                                                                 (
 a * = (a − a 0 ) - right fuzziness index function of a respectively. Hence the given data in the form a = a 0 , a * , a * is
                                                              %                                                   %          )




                                                               61
Mathematical Theory and Modeling                                                                                           www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


Table 2 Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = a 0 , a * , a *
                                                                       %                            (          )
                                              Fuzzy duration/d                Fuzzy cost rate/10 yuan d-1
                                                                                                        4


Activity                                      Min.               Min.         Crash cost rate           Normal cost        Indirect
                  Activity name
index                                         crash              normal                                 Rate               cost rate
                                              Duration           Duration
1-2        Material preparing                 (30,2,2)           (32,1,1)     (1.9,.0.2,0.2)            (0.35,0.05,0.05)   (0.12,0.02,0.02)
1-3        JP3Self-making                     (23,3,3)           (26,2,2)     (2,0.1,0.1)               (0.65,0.05,0.05)   (0.2,0.02,0.02)
           components
1-4        The cell manufacture               (19,4,4)           (20,1,1)     (1.8,0.1,0.1)             (0.55,0.1,0.1)     (0.17,0.03,0.03)
2-5        Pipi-parts manufacture             (14,4,4)           (18,2,2)     (1.55,0.05,0.05)          (0.55,0.05,0.05)   (0.17,0.02,0.02)
5-8        Parts assembly                     (20,3,3)           (21,2,2)     (1.85,0.05,0.05)          (0.5,0.1,0.1)      (0.17,0.03,0.03)
3-6        Block building                     (13,3,3)           (15,1,1)     (2.1,0.1,0.1)             (0.6,0.05,0.05)    (0.17,0.02,0.02)
6-8        Pallet assembly                    (11,3,3)           (14,1,1)     (1.45,0.05,0.05)          (0.45,0.05,0.05)   (0.15,0. 02,0.02)
4-7        Sections building                  (19,3,3)           (23,2,2)     (2,0.1,0.1)               (0.7,0.1,0.1)      (0.20,0.02,0.02)
7-9        Zone construction                  (12,2,2)           (14,1,1)     (2.4,0.1,0.1)             (0.75,0.05,0.05)   (0.21,0.02,0.02)
8-9        Building berth healing             (5,1,1)            (6,1,1)      (2.5,0.1,0.1)             (0.85,0.05,0.05)   (0.23,0.03,0.03)


                                    (18, 2, 2)                   (21, 2, 2)
                (32, 1, 1)     2                         5                    8
                                                                                            (6, 1, 1)
                       (26, 2, 2)           (15, 1, 1)               (14, 1, 1)
                   1                3                        6                                  9
                                                                               (14, 1, 1)
                (20, 1, 1)                     (23, 2, 2)
                                        4                            7


1 – 2 – 5 – 8 – 9 is the critical path and 1 – 2, 2 – 5, 5 – 8, 8 – 9 are the critical activities




                                                                     62
Mathematical Theory and Modeling                                                                                                     www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


Table 3 Slope of Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = a 0 , a * , a *
                                                                                %                                     (          )
      Normal                                     Crash
                       Normal cost                                 Crash cost                                                         ∆C
      time                                       time                                       ∆t = NT − CT        ∆C = CC − NC
                       NC                                           CC                                                                ∆t
       NT                                         CT

1-2   (32,1,1)         (0.35,0.05,0.05)          (30,2,2)          (1.9,0.2,0.2)           (2,2,2)              (1.55,0.2,0.2)       (0.78,2,2)-II

1-3   (26,2,2)         (0.65,0.05,0.05)          (23,3,3)          (2,0.1,0.1)             (3,3,3)              (1.35,0.1,0.1)       (0.45,3,3)

1-4   (20,1,1)         (0.55,0.1,0.1)            (19,4,4)          (1.8,0.1,0.1)           (1,4,4)              (1.25,0.1,0.1)       (1.25,4,4)

2-5   (18,2,2)         (0.55,0.05,0.05)          (14,4,4)          (1.55,0.05,0.05)        (4,4,4)              (1.00,0.05,0.05)     (0.25,4,4)-I

5-8   (21,2,2)         (0.5,0.1,0.1)             (20,3,3)          (1.85,0.05,0.05)        (1,3,3)              (1.35,0.1,0.1)       (1.35,3,3)-III

3-6   (15,1,1)         (0.6,0.05,0.05)           (13,3,3)          (2.1,0.1,0.1)           (2,3,3)              (1.5,0.1,0.1)        (0.75,3,3)

6-8   (14,1,1)         (0.45,0.05,0.05)          (11,3,3)          (1.45,0.05,0.05)        (3,3,3)              (1,0.05,0.05)        (0.33,3,3)

4-7   (23,2,2)         (0.7,0.1,0.1)             (19,3,3)          (2,0.1,0.1)             (4,3,3)              (1.3,0.1,0.1)        (0.33,3,3)

7-9   (14,1,1)         (0.75,0.05,0.05)          (12,2,2)          (2.4,0.1,0.1)           (2,2,2)              (1.65,0.1,0.1)       (0.83,2,2)

8-9   (6,1,1)          (0.85,0.05,0.05)          (5,1,1)           (2.5,0.1,0.1)           (1,1,1)              (1.65,0.1,0.1)       (1.65,1,1)-IV

  Direct cost          (5.95,1,1)


Step: 1        Since (2-5) has least crash slope, crash (2-5) by (4 , 4, 4)
                                            (14, 4, 4)                   (21, 2, 2)
                                2                              5                      8
          (32, 1, 1)                                               (14, 1, 1)                       (6, 1, 1)
                        (26, 2, 2)               (15, 1, 1)
                   1                    3                            6                                   9
                   (20, 1, 1)                      (23, 2, 2)                               (14, 1, 1)
                                            4                              7


Step: 2 Crash (1 – 2) by (2, 2, 2)

                                    (14,4, 4)                  (21,2,2)
                         2                          5                           8
      (30, 2,2)                                                                           (6,1,1)
                                                           (14,1,1)
                 (26,2,2)               (15,1,1)
           1                    3                          6                                    9
                                                                          (14,1,1)
           (20, 1,1)                            (23, 2,2)
                                    4                                7




                                                                                63
Mathematical Theory and Modeling                                                                                 www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


Step: 3 Crash (5 – 8) by (1, 3, 3)
                               (14,4, 4)               (20,3,3)
                          2                       5                    8
         (30, 2,2)                                                               (6,1,1)
                     (26,2,2             (15,1,1)                (14,1,1)
             1                 3                       6                                   9

             (20, 1,1)                      (23, 2,2)                       (14,1,1)
                                   4                         7
         Step: 4 Crash (8 – 10) by (1,1,1)


                               (14,4, 4)               (20,3,3)
                         2                        5                    8
         (30, 2,2)                                                             (5,1,1)
                                                      (14,1,1)
                                       (15,1,1)
             1 (26,2,2)        3                       6                                 9

             (20, 1,1)
                                   4                         7
                                         (23, 2,2)                    (14,1,1)

                                            Table-4
                                                                            Direct cost
Stage            Crash                 Current duration                                          Indirect cost      Total cost
                                                                  = (Normal cost + Crash cost)
(1)        (2-5) by (4,4,4)        (73,4,4,)                     (12.15,4,4)                     (11.17,4,4)       (23.52,4,4)
(2)        (1-2) by (2,2,2)        (71,4,4)                      (9.75,4,4)                      (10.93,4,4)       (20.68,4,4)
(3)        (5-8) by (1,3,3)        (70,4,4)                      (7.8,4,4)                       (10.76,4,4)       (18.56,4,4)
(4)        (8-10) by (1,1,1)       (69,4,4)                      (8.45,4,4)                      (10.53,4,4)       (18.98,4,4)


From the above table we can see that after stage 3 the total cost starts increasing. Hence the optimal duration is
(70,4,4) and the corresponding optimal cost is (18.56,4,4) 104 yuan..

5. Conclusion
This paper investigated the fuzzy network crashing problem in the project network with several fuzzy parameters.
The validity of the proposed method is examined with numerical example. The applicability of the above procedure
is useful for various types of problems in which uncertain results are compassed. We can consider this approach
faster and easier to complete the project in shortest possible duration.
References
  [1].     Abbasbandy.S and Hajjari. T, (2009). “A new approach for ranking of trapezoidal fuzzy numbers”,
           Computers and Mathematics with Applications, 57, 413–419.

  [2].     Badiru, A.B., (1991) “A simulation approach to Network analysis”. Simulation, 57: 245-255.

  [3].     Chanas S, Kamburowski J (1981) The use of fuzzy variables in PERT. Fuzzy Sets Syst 5:11–19

  [4].     Coskun, O., (1984) “Optimal probabilistic compression of PERT networks”, J. Construct. Eng. Manage.,

                                                                      64
Mathematical Theory and Modeling                                                                     www.iiste.org
ISSN 2224-5804 (Paper)    ISSN 2225-0522 (Online)
Vol.2, No.6, 2012


        110: 437-446.

 [5].   Feng C.W., L. Liu and S.A. Burns, (2000) “Stochastic construction time-cost tradeoff analysis”. J. Comput.
        Civil Eng., 14: 117-126.

 [6].   Jin Chao-guang, Jl Zhuo-shang I , Lin Yan'- Zhao Yuan-min, and Huang Zhen-dong (2005) “Research on
        the fully fuzzy time-cost trade-off based on genetic algorithms”, Journal of Marine Science and Application,
        Vol. 4, No. 3

 [7].   Johnson, G.A. and C.D. Schou, (1990) “Expediting projects in PERT with stochastic time estimates”,
        Project Manager. J., 21: 29-32.

 [8].   Liou.T.S and Wang.M.J, (1992) “Ranking fuzzy numbers with integral value”, Fuzzy sets and
        systems,50,3,247-255

 [9].   Ming Ma, Menahem Friedman, Abraham Kandel, (1999) “A new fuzzy arithmetic, Fuzzy sets and
        systems”,108,83-90

 [10]. Mohanaselvi S. et al.       (2012) “Fuzzy Optimal Solution to Fuzzy Transportation Problem: A New
        Approach” / International Journal on Computer Science and Engineering (IJCSE) ISBN: 0975-3397 Vol. 4
        No. 03   367-375.

 [11]. Pulat, P.S. and S.J. Horn, (1996) “Time-resource tradeoff problem [project scheduling]”. IEEE Trans. Eng.
        Manage., 43: 411-417.

 [12]. Rehab, R. and R.I. Carr, ( 1989) “Time-cost trade-off among related activities”, J. Construct. Eng. Manage.,
        115: 475-486.

 [13]. Shakeela Sathish, K. Ganesan (2011) “A simple approach to fuzzy critical path analysis in project networks”
        International Journal of Scientific & Engineering Research Volume 2, Issue 12, ISSN 2229-5518.

 [14]. Steve, P. Jr. and M.I. Dessouky, (1977) “Solving the project time/cost tradeoff problem using the minimal
        cut concept”, Manage. Sci., 24: 393-400.

 [15]. Van Slyke, R.M., (1963) “Monte carlo methods and the PERT problem”, Operat. Res., 33: 141-143.

 [16]. Wakas S. Khalaf, Leong Wah June, Mohd Rizam B. Abu Bakar and Lee Lai Soon (2011) “A Comparative
        Study on Time-cost Trade-off Approaches within Critical Path Method, Journal of Applied Sciences 11 (6):
        920-931, ISSN 1812-5654, DOI: 10.3923/jas.2011.920.931.




                                                        65
This academic article was published by The International Institute for Science,
Technology and Education (IISTE). The IISTE is a pioneer in the Open Access
Publishing service based in the U.S. and Europe. The aim of the institute is
Accelerating Global Knowledge Sharing.

More information about the publisher can be found in the IISTE’s homepage:
http://www.iiste.org


The IISTE is currently hosting more than 30 peer-reviewed academic journals and
collaborating with academic institutions around the world. Prospective authors of
IISTE journals can find the submission instruction on the following page:
http://www.iiste.org/Journals/

The IISTE editorial team promises to the review and publish all the qualified
submissions in a fast manner. All the journals articles are available online to the
readers all over the world without financial, legal, or technical barriers other than
those inseparable from gaining access to the internet itself. Printed version of the
journals is also available upon request of readers and authors.

IISTE Knowledge Sharing Partners

EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open
Archives Harvester, Bielefeld Academic Search Engine, Elektronische
Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial
Library , NewJour, Google Scholar

Weitere ähnliche Inhalte

Was ist angesagt?

Algorithm chapter 1
Algorithm chapter 1Algorithm chapter 1
Algorithm chapter 1chidabdu
 
01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms Notes01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms NotesAndres Mendez-Vazquez
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentIJERD Editor
 
design and analysis of algorithm
design and analysis of algorithmdesign and analysis of algorithm
design and analysis of algorithmMuhammad Arish
 
Sienna 13 limitations
Sienna 13 limitationsSienna 13 limitations
Sienna 13 limitationschidabdu
 
Machine Learning
Machine LearningMachine Learning
Machine Learningbutest
 
Sparse data formats and efficient numerical methods for uncertainties in nume...
Sparse data formats and efficient numerical methods for uncertainties in nume...Sparse data formats and efficient numerical methods for uncertainties in nume...
Sparse data formats and efficient numerical methods for uncertainties in nume...Alexander Litvinenko
 
How principal components analysis is different from factor
How principal components analysis is different from factorHow principal components analysis is different from factor
How principal components analysis is different from factorArup Guha
 
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...IJERA Editor
 
Comparitive Analysis of Algorithm strategies
Comparitive Analysis of Algorithm strategiesComparitive Analysis of Algorithm strategies
Comparitive Analysis of Algorithm strategiesTalha Shaikh
 

Was ist angesagt? (20)

02 Notes Divide and Conquer
02 Notes Divide and Conquer02 Notes Divide and Conquer
02 Notes Divide and Conquer
 
Algorithm chapter 1
Algorithm chapter 1Algorithm chapter 1
Algorithm chapter 1
 
01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms Notes01 Notes Introduction Analysis of Algorithms Notes
01 Notes Introduction Analysis of Algorithms Notes
 
Probability Assignment Help
Probability Assignment HelpProbability Assignment Help
Probability Assignment Help
 
International Journal of Engineering Research and Development
International Journal of Engineering Research and DevelopmentInternational Journal of Engineering Research and Development
International Journal of Engineering Research and Development
 
Bm35359363
Bm35359363Bm35359363
Bm35359363
 
design and analysis of algorithm
design and analysis of algorithmdesign and analysis of algorithm
design and analysis of algorithm
 
Sienna 13 limitations
Sienna 13 limitationsSienna 13 limitations
Sienna 13 limitations
 
Machine Learning
Machine LearningMachine Learning
Machine Learning
 
Bq25399403
Bq25399403Bq25399403
Bq25399403
 
Spectral factorization
Spectral factorizationSpectral factorization
Spectral factorization
 
algorithm Unit 2
algorithm Unit 2 algorithm Unit 2
algorithm Unit 2
 
Sparse data formats and efficient numerical methods for uncertainties in nume...
Sparse data formats and efficient numerical methods for uncertainties in nume...Sparse data formats and efficient numerical methods for uncertainties in nume...
Sparse data formats and efficient numerical methods for uncertainties in nume...
 
Fst ch2 notes
Fst ch2 notesFst ch2 notes
Fst ch2 notes
 
I1803014852
I1803014852I1803014852
I1803014852
 
Divide and Conquer
Divide and ConquerDivide and Conquer
Divide and Conquer
 
How principal components analysis is different from factor
How principal components analysis is different from factorHow principal components analysis is different from factor
How principal components analysis is different from factor
 
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...
The Analysis of Performance Measures of Generalized Trapezoidal Fuzzy Queuing...
 
Q
QQ
Q
 
Comparitive Analysis of Algorithm strategies
Comparitive Analysis of Algorithm strategiesComparitive Analysis of Algorithm strategies
Comparitive Analysis of Algorithm strategies
 

Ähnlich wie Fully fuzzy time cost trade-off in a project network - a new approach

Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberSolving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
 
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberSolving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberIJERA Editor
 
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGA
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGAScientific Computing II Numerical Tools & Algorithms - CEI40 - AGA
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGAAhmed Gamal Abdel Gawad
 
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHES
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHESVARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHES
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHESIAEME Publication
 
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...TELKOMNIKA JOURNAL
 
Some Engg. Applications of Matrices and Partial Derivatives
Some Engg. Applications of Matrices and Partial DerivativesSome Engg. Applications of Matrices and Partial Derivatives
Some Engg. Applications of Matrices and Partial DerivativesSanjaySingh011996
 
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...IAEME Publication
 
An econometric model for Linear Regression using Statistics
An econometric model for Linear Regression using StatisticsAn econometric model for Linear Regression using Statistics
An econometric model for Linear Regression using StatisticsIRJET Journal
 
On similarity of fuzzy triangles
On similarity of fuzzy trianglesOn similarity of fuzzy triangles
On similarity of fuzzy trianglesijfls
 
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...SSA KPI
 
Fuzzy inventory model with shortages in man power planning
Fuzzy inventory model with shortages in man power planningFuzzy inventory model with shortages in man power planning
Fuzzy inventory model with shortages in man power planningAlexander Decker
 
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...ijcsit
 
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...IJERA Editor
 
Paper computer
Paper computerPaper computer
Paper computerbikram ...
 
Paper computer
Paper computerPaper computer
Paper computerbikram ...
 
Polynomial regression model of making cost prediction in mixed cost analysis
Polynomial regression model of making cost prediction in mixed cost analysisPolynomial regression model of making cost prediction in mixed cost analysis
Polynomial regression model of making cost prediction in mixed cost analysisAlexander Decker
 
11.polynomial regression model of making cost prediction in mixed cost analysis
11.polynomial regression model of making cost prediction in mixed cost analysis11.polynomial regression model of making cost prediction in mixed cost analysis
11.polynomial regression model of making cost prediction in mixed cost analysisAlexander Decker
 
A NEW OPERATION ON HEXAGONAL FUZZY NUMBER
A NEW OPERATION ON HEXAGONAL FUZZY NUMBERA NEW OPERATION ON HEXAGONAL FUZZY NUMBER
A NEW OPERATION ON HEXAGONAL FUZZY NUMBERijfls
 

Ähnlich wie Fully fuzzy time cost trade-off in a project network - a new approach (20)

Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberSolving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
 
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy NumberSolving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
Solving Fuzzy Maximal Flow Problem Using Octagonal Fuzzy Number
 
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGA
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGAScientific Computing II Numerical Tools & Algorithms - CEI40 - AGA
Scientific Computing II Numerical Tools & Algorithms - CEI40 - AGA
 
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHES
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHESVARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHES
VARIOUS FUZZY NUMBERS AND THEIR VARIOUS RANKING APPROACHES
 
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...
Using Alpha-cuts and Constraint Exploration Approach on Quadratic Programming...
 
Some Engg. Applications of Matrices and Partial Derivatives
Some Engg. Applications of Matrices and Partial DerivativesSome Engg. Applications of Matrices and Partial Derivatives
Some Engg. Applications of Matrices and Partial Derivatives
 
Mtc ssample05
Mtc ssample05Mtc ssample05
Mtc ssample05
 
Mtc ssample05
Mtc ssample05Mtc ssample05
Mtc ssample05
 
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...
FUZZY ARITHMETIC OPERATIONS ON DIFFERENT FUZZY NUMBERS AND THEIR VARIOUS FUZZ...
 
An econometric model for Linear Regression using Statistics
An econometric model for Linear Regression using StatisticsAn econometric model for Linear Regression using Statistics
An econometric model for Linear Regression using Statistics
 
On similarity of fuzzy triangles
On similarity of fuzzy trianglesOn similarity of fuzzy triangles
On similarity of fuzzy triangles
 
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
Efficient Solution of Two-Stage Stochastic Linear Programs Using Interior Poi...
 
Fuzzy inventory model with shortages in man power planning
Fuzzy inventory model with shortages in man power planningFuzzy inventory model with shortages in man power planning
Fuzzy inventory model with shortages in man power planning
 
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...
COMPARISON OF WAVELET NETWORK AND LOGISTIC REGRESSION IN PREDICTING ENTERPRIS...
 
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...
Transportation Problem with Pentagonal Intuitionistic Fuzzy Numbers Solved Us...
 
Paper computer
Paper computerPaper computer
Paper computer
 
Paper computer
Paper computerPaper computer
Paper computer
 
Polynomial regression model of making cost prediction in mixed cost analysis
Polynomial regression model of making cost prediction in mixed cost analysisPolynomial regression model of making cost prediction in mixed cost analysis
Polynomial regression model of making cost prediction in mixed cost analysis
 
11.polynomial regression model of making cost prediction in mixed cost analysis
11.polynomial regression model of making cost prediction in mixed cost analysis11.polynomial regression model of making cost prediction in mixed cost analysis
11.polynomial regression model of making cost prediction in mixed cost analysis
 
A NEW OPERATION ON HEXAGONAL FUZZY NUMBER
A NEW OPERATION ON HEXAGONAL FUZZY NUMBERA NEW OPERATION ON HEXAGONAL FUZZY NUMBER
A NEW OPERATION ON HEXAGONAL FUZZY NUMBER
 

Mehr von Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

Mehr von Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Kürzlich hochgeladen

EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEarley Information Science
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesSinan KOZAK
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfEnterprise Knowledge
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerThousandEyes
 
🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘RTylerCroy
 
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure serviceWhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure servicePooja Nehwal
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonAnna Loughnan Colquhoun
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationMichael W. Hawkins
 
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...gurkirankumar98700
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Allon Mureinik
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationRadu Cotescu
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Scriptwesley chun
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityPrincipled Technologies
 
Developing An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilDeveloping An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilV3cube
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...Neo4j
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Igalia
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptxHampshireHUG
 

Kürzlich hochgeladen (20)

EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptxEIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
EIS-Webinar-Prompt-Knowledge-Eng-2024-04-08.pptx
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
 
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
Neo4j - How KGs are shaping the future of Generative AI at AWS Summit London ...
 
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdfThe Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
The Role of Taxonomy and Ontology in Semantic Layers - Heather Hedden.pdf
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
🐬 The future of MySQL is Postgres 🐘
🐬  The future of MySQL is Postgres   🐘🐬  The future of MySQL is Postgres   🐘
🐬 The future of MySQL is Postgres 🐘
 
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure serviceWhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
WhatsApp 9892124323 ✓Call Girls In Kalyan ( Mumbai ) secure service
 
Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
GenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day PresentationGenCyber Cyber Security Day Presentation
GenCyber Cyber Security Day Presentation
 
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
Kalyanpur ) Call Girls in Lucknow Finest Escorts Service 🍸 8923113531 🎰 Avail...
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)
 
Scaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organizationScaling API-first – The story of a global engineering organization
Scaling API-first – The story of a global engineering organization
 
Automating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps ScriptAutomating Google Workspace (GWS) & more with Apps Script
Automating Google Workspace (GWS) & more with Apps Script
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
Boost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivityBoost PC performance: How more available memory can improve productivity
Boost PC performance: How more available memory can improve productivity
 
Developing An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of BrazilDeveloping An App To Navigate The Roads of Brazil
Developing An App To Navigate The Roads of Brazil
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
Raspberry Pi 5: Challenges and Solutions in Bringing up an OpenGL/Vulkan Driv...
 
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
04-2024-HHUG-Sales-and-Marketing-Alignment.pptx
 

Fully fuzzy time cost trade-off in a project network - a new approach

  • 1. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Fully Fuzzy Time-Cost Trade-Off in a Project Network - A New Approach Shakeela Sathish Department of Mathematics, Faculty of Engineering and Technology, SRM University, Ramapuram Campus, Chennai - 600 091, India Email: shakeela.s@rmp.srmuniv.ac.in,shakeela_sathish@yahoo.co.in K. Ganesan Department of Mathematics, Faculty of Engineering and Technology, SRM University, Kattankulathur, Chennai - 603203, India Email: ganesan.k@ktr.srmuniv.ac.in ,gansan_k@yahoo.com Abstract In this paper, we propose a new approach to Fuzzy network crashing in a project network whose activity times are uncertain. The uncertain parameters in the project network are represented by triangular fuzzy numbers. By using a new type of fuzzy arithmetic and a fuzzy ranking method we propose a method for finding an optimal duration by crashing the fuzzy activities of a project network without converting the fuzzy activity times to classical numbers. A numerical example is provided to illustrate the proposed method. Keywords: Triangular fuzzy number, fuzzy ranking, fuzzy project network, Critical path, crashing. 1. Introduction Project management involves project scheduling, planning, evaluating, and controlling. Activity networks have proven very useful for the performance evaluation of certain types of projects. The critical path method is an important tool to identify the critical activities in the critical path of an activity network for project management. Project crashing is a technique used to shorten the project duration by accelerating some of its activities at an additional expense. The objective of crashing is to reduce project duration while minimizing the cost, which is also known as time-cost trade off problem. Reducing project durations can be done by providing additional resources to those activities in the critical path. Project managers are intended to spend the minimum possible amount of money and achieve the maximum crashing time, as a result both direct and indirect costs will be influenced in the project. While crashing any critical activity by providing extra resources the direct cost will increase whereas the indirect cost will reduce and vice versa. Therefore there is some compromise in project duration – a balance between excessive direct costs for shortening the project duration and excessive indirect costs for lengthening the project duration which we call as optimum project duration. The successful implementation of CPM requires the exact values on activity durations, resources, money etc. However in reality, due to the non availability and uncertainty of information as well as the variation of management scenario, it is often difficult to obtain the exact values of the decision parameters of the problems. Thus, the conventional approaches, both deterministic and random process, tend to be less effective in conveying the imprecision or vagueness nature of the linguistic assessment. Consequently, the fuzzy set theory can play a significant role in this kind of decision making environment to tackle the unknown or the vagueness about the 53
  • 2. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 decision parameters in a project network. The fuzzy PERT was originated by Chanas and Kamburowski [3]. Motivated by this article several authors have studied the fuzzy crashing of fuzzy PERT problem. Steve and DessoukyError! Reference source not found. described a procedure for solving the project time/cost tradeoff problem of reducing project duration at a minimum cost. Rehab and Carr Error! Reference source not found. described the typical approach that construction planners take in performing time-Cost Trade-off (TCT). Pulat and Horn Error! Reference source not found. described a project network with a set of tasks to be completed according to some precedence relationship; the objective is to determine efficient project schedules for a range of project realization times and resource cost per time unit for each resource. Van SlykeError! Reference source not found. demonstrated several advantages of applying simulation techniques to PERT, including more accurate estimates of the true project length, flexibility in selecting any distribution for activity times and the ability to calculate “criticality indexes”, which are the probability of various activities being on the critical path. Van Slyke was the first to apply Monte Carlo simulations to PERT. Coskun[3]formulated the problem as a Chance Constrained Linear Programming. Johnson and Schon [7] used simulation to compare three rules for crashing stochastic networks. Badiru[1]reported development of another simulation program for project management called STARC. Feng et al [5] presented a hybrid approach that combines simulation techniques with a genetic algorithm to solve the time-cost trade-off problem under uncertainty. In this paper, we use triangular fuzzy numbers to effectively deal with the ambiguities involved in the process of linguistic values. Applying a new type of fuzzy arithmetic and a fuzzy ranking method [8,9], we propose a method for finding an optimal duration by crashing the fuzzy activities of a project network without converting the fuzzy activity times to classical numbers. A numerical example is provided to illustrate the proposed method. The rest of this paper is organized as follows. In section 2 we recall the basic concepts of fuzzy numbers, fuzzy arithmetic and their rankings. In section 3, we introduce the concept of fuzzy network crashing. In section 4, a numerical example is given to illustrate the method proposed in this paper. 2. Preliminaries The aim of this section is to present some notations, notions and results which are of useful in our further study. Definition 2.1 % A fuzzy set a defined on the set of real numbers R is said to be a fuzzy number if its membership function a : R → [0,1] has the following study. % % (a) a is convex, a {λx1 +(1-t)x 2 } =min {a(x1 ),a(x 2 )} , for all x1 , x 2 ∈ R and λ ∈ [0,1] % % % (b) % a is normal i.e. there exists an x ∈ R such that a ( x ) = 1 % (c) % a is Piecewise continuous. Definition 2.2 % A fuzzy number a on R is said to be a triangular fuzzy number (TFN) or linear fuzzy number if its membership function a% : R → [0,1] has the following characteristics:  x - a1  a - a , for a1 ≤ x ≤ a 2  2 1  a -x a (x) =  3 % , for a 2 ≤ x ≤ a 3  a3 - a2  0, elsewhere   54
  • 3. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 We denote this triangular fuzzy number by % a = (a1 , a 2 , a 3 ). We use F(R) to denote the set of all triangular fuzzy numbers. Also if m = a 2 represents the modal value or midpoint, α = ( a 2 − a1 ) represents the left spread and β = (a 3 − a 2 ) represents the right spread of the triangular fuzzy number % a = (a1 , a 2 , a 3 ), % then the triangular fuzzy number a can be represented by the triplet a = ( α,m,β ) . i.e. a = (a1 , a 2 , a 3 ) = ( α, m, β ) . % % Definition 2.3 A triangular fuzzy number a ∈ F(R) can also be represented as a pair a = ( a, a ) of functions % % a ( r ) and a ( r ) for 0 ≤ r ≤ 1 which satisfies the following requirements: (i). a ( r ) is a bounded monotonic increasing left continuous function. (ii). a ( r ) is a bounded monotonic decreasing left continuous function. (iii). a ( r ) ≤ a ( r ) , 0 ≤ r ≤ 1  a(1) + a(1)  Definition 2.4 For an arbitrary triangular fuzzy number a = ( a ,a ) , the number a 0 =  %  is said to be a  2  location index number of a . The two non-decreasing left continuous functions a * = (a 0 − a), % a * = (a − a 0 ) are called the left fuzziness index function and the right fuzziness index function respectively. Hence every triangular ( fuzzy number a = (a1 , a 2 , a 3 ) can also be represented by a = a 0 , a * , a * % % ) 2.1 Ranking of triangular Fuzzy Numbers Many different approaches for the ranking of fuzzy numbers have been proposed in the literature. Abbasbandy and Hajjari [1] proposed a new ranking method based on the left and the right spreads at some α -levels of fuzzy numbers. % ( ) ( For an arbitrary triangular fuzzy number a = (a1 , a 2 , a 3 ) = a 0 , a * , a * with parametric form a = a(r), a(r) , we % ) 55
  • 4. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 % define the magnitude of the triangular fuzzy number a by 1 1  Mag(a) =  ∫ ( a + a + a 0 ) f (r) dr  % 2 0  1 1 ∗  where the function f (r) is a =  ∫ ( a + 4a 0 − a ∗ ) f (r) dr  . 2 0  non-negative and increasing function 1 1 on [0,1] with f (0) = 0, f (1) = 1 and ∫ f (r) dr = . The function f (r) can be considered as a weighting function. 0 2 In real life applications, f (r) can be chosen by the decision maker according to the situation. In this paper, for convenience we use f (r) = r .  a ∗ + 4a 0 − a ∗   a + a + a 0  Hence Mag(a) =  % = . 4  4      % The magnitude of a triangular fuzzy number a synthetically reflects the information on every membership degree, % % and meaning of this magnitude is visual and natural. Mag ( a ) is used to rank fuzzy numbers. The larger Mag( a ), the larger fuzzy number. % ( % ) ( ) For any two triangular fuzzy numbers a = a 0 , a * , a * and b = b 0 , b* , b* in F(R), we define the ranking of a and % % % % b by comparing the Mag ( a ) and Mag ( b ) on R as follows: % % % (i). a f b if and only if Mag( a ) ≥ % Mag( b ) (ii). % % % % a p b if and only if Mag( a ) ≤ Mag( b ) (iii). % % % a ≈ b if and only if Mag( a ) = Mag( b ) % Definition 2.5 ( A triangular fuzzy number a = a 0 , a * , a * % ) is said to be symmetric if and only if a * = a * . Definition 2.6 ( ) A triangular fuzzy number a = a 0 , a * , a * is said to be non-negative if and only if Mag ( a ) ≥ 0 and is denoted by % % % % ( ) a f 0. Further if Mag( a ) > 0, then a = a 0 , a * , a * is said to be a positive fuzzy number and is denoted by % % % % af 0 . Definition 2.7 ( % ) ( ) Two triangular fuzzy numbers a = a 0 , a * , a * and b = b 0 , b* , b* in F(R) are said to be equivalent if and only if % % % Mag( a ) = Mag( b ).That is % % % a ≈ b if and only if Mag( a ) = Mag( b ).Two triangular fuzzy numbers % ( ) % ( ) a = a 0 , a * , a * and b = b0 , b* , b* in F(R) are said to be equal if and only if a 0 = b0 , a * = b* , a * = b* . That is % 56
  • 5. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 % % a = b if and only if a 0 = b0 , a * = b* , a * = b* . 2.2 Arithmetic operations on triangular Fuzzy Numbers Ming Ma et al. [9] have proposed a new fuzzy arithmetic based upon both location index and fuzziness index functions. The location index number is taken in the ordinary arithmetic, whereas the fuzziness index functions are considered to follow the lattice rule which is least upper bound in the lattice L. That is for a, b∈L we define a ∨ b = max {a, b} and a ∧ b = min {a, b} . For arbitrary triangular fuzzy numbers a = a 0 , a * , a * % ( ) % ( and b = b0 , b* , b* ) and ∗ = {+, −, ×, ÷} , the arithmetic operations on the triangular fuzzy numbers are defined by % % ( ) a ∗ b = a 0 ∗ b0 , a * ∨ b* , a * ∨ b* . In particular for any two ( triangular fuzzy numbers a = a 0 , a * , a * % ) % ( ) and b = b0 , b* , b* , we define ( ) ( ) ( (i) Addition: a + b = a 0 , a * , a * + b0 , b* , b* = a 0 + b0 , max {a * , b* } , max a * , b* % % { }) ( ) ( ) ( (ii) Subtraction: a − b = a 0 , a * , a * − b 0 , b* , b* = a 0 − b 0 , max {a * , b* } , max a * , b* . % % { }) ( ) ( ) ( { }) (iii) Multiplication: a × b = a 0 , a * , a * × b 0 , b* , b* = a 0 × b 0 , max {a * , b* } , max a * , b* . % % % % ( (iv) Division: a ÷ b = a 0 , a * , a * ) ÷ ( b , b , b ) = ( a ÷ b , max {a , b } , max {a , b }) . 0 * * 0 0 * * * * 3. Fuzzy Crashing Fuzzy project network is an acyclic digraph, where the vertices represent events, and the directed edges represent the activities, to be performed in a project. We denote this fuzzy project network by N = (V, A, T ) . Let % % % % % % % V = {v1 ,v2 ,v3 ,...,vn } be the set of fuzzy vertices (events), where v1 and vn are the tail and head events of the % % % % % % % % % × % project, and each v1 belongs to some path from v1 to vn . Let A ∈ (V 鬃 V) be the set of directed edges A { % ij %i % j %i % j } % = a = ( v ,v ) / for v ,v ∈ V , that represents the activities to be performed in the project. Activity a % % ij % % % is then represented by one, and only one, arrow with a tail event vi and a head event v j . For each activity aij , a t % fuzzy number %ij ∈ T is defined as the fuzzy time required for the completion of aij . A critical path is a longest path % % % % from the initial event v1 to the terminal event vn of the project network, and an activity aij on a critical path is called a critical activity. Most of the existing time-cost trade-off models rely on conditions where the activity time-cost relationships are assumed to be deterministic. A typical activity time - cost relationship is shown in Fig. 1. However, during project implementation, many uncertain factors, such as weather, productivity level, human factors etc., dynamically affect activity durations and costs. The activity time-cost relationship is no longer a monotonously decreasing curve as shown in Fig. 1. In this paper durations and costs are both characterized by triangular fuzzy numbers and the fuzzy relationship between time and cost is shown in Fig. 2. 57
  • 6. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Figure 1 Deterministic relationship between time and cost of an active Figure 2 Fuzzy relationship between time and cost of an activity 3.1 Notations % aij : Project’s activities, where, i = (1, 2, 3,…, n) ~ B: Maximum available budget ~ T: Shortest possible duration to complete the project at least cost within the maximum available budget ~ F: The desired project completion time at least cost ~ T N, I; : Normal time for activity i ~ T C , I; Crash time for activity i ~ C N, I; Normal cost for activity i ~ C C , I: Crash cost for activity i ~ U i: Cost slope for activity i ~ C P: Critical path (longest path in the project network) ~ D N, q: Normal time for critical activity q, where q = (1, 2, 3,…, L) ~ D C, q: Crash time for critical activity q ~ C N, j: Normal cost for noncritical activity j, where j = (1, 2, 3,…, m) ~ C C , q: Crash cost for critical activity q 58
  • 7. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 ~ U S: Cost slope for critical activity S, where S begin with critical activity that has the smallest cost slope = (1, 2, 3,…, Y) ~ U x: Cost slope for noncritical activity x, where x begin with noncritical activity that has the biggest cost slope = (1, 2, 3,…, z) ~ D r, S: Max reduction in duration for critical activity S TC N : Total cost to complete the project in normal condition TC a: Total cost to complete the project by crashing all activities (crash condition) TC C: Total cost to complete the project by CCA TE C: Extra cost that adding to crash critical activities θCrashForT: Number of steps to meet F (considering F>T) or obtain T (considering F = T) by CCA CCA: Approach of crashing critical activities 3.2 General descriptions and formulations Critical path of the project network in normal condition: L CP k = ∑ D N,q (1) q =1 Total cost of the project in normal condition: n TC N = ∑ C N,2 ( 2) i =1 Total cost of the project by crashing all activities: n TCa = ∑ Cc,i ( 3) i =1 Critical path of the project network by crashing all activities: L C PC = ∑ D c,q (4) q =1 Total extra cost that adding to crash critical activities: Y TE t = ∑ D r,s U s (5) S =1 Total cost of the project by CCA: TCC = TC N + TC E (6) Number of steps to meet F (considering F>T) or complete the project within T (considering F = T) by CCA: Y θCrash Fort = ∑ D r, s (7) s =1 3.3 Algorithm 59
  • 8. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Step1: Draw the project network Step2: Determine the normal time and normal cost for each activity to determine the critical and noncritical activities Step3: Compute the normal total cost and normal duration of the project completion. If F equals the normal duration of completion then we stop the procedure Step 4 : Find the project cost by the formula Project cost = (Direct cost + (Indirect cost*project duration)) Step 5 : Find the minimum cost slope by the formula Cost slope = (Crash cost - Normal cost)/(Normal time - Crash time) Step 6 : Determine the crash time and crash cost for each activity to compute the cost slope Step 7 : Identify the activity with the minimum cost slope and crash that activity. Identify the new critical path and find the cost of the project by formula Project Cost= ((Project Direct Cost + Crashing cost of crashed activity) + Indirect Cost*project duration)) Step 8 : Crash all activities in the project simultaneously Step 9 : Draw the project network after crashing all activities Step10 : Determine the critical path and noncritical paths Also, identify the critical activities Step11: In the In the new Critical path select the activity with the next minimum cost slope, and repeat this step until all the activities along the critical path are crashed upto desired time. Step12: At this point all the activities are crashed and further crashing is not possible. The crashing of non critical activities does not alter the project duration time and is of no use. 4. Numerical Example A precedence relationships network of a project with nine activities is depicted in the diagram. The crash time and normal time of an activity are triangular fuzzy numbers and crash cost rate and normal cost rate also are triangular fuzzy numbers (as shown in Table 1). 60
  • 9. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 % Table 1 Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = (a1 , a 2 , a 3 ) Fuzzy duration/d Fuzzy cost rate/104 yuan d-1 Activity Activity name Min. crash Min. normal Crash cost Normal cost Indirect index Duration Duration rate Rate cost rate 1-2 Material preparing (28,30,32) (31,32,33) (1.7,1.9,2. 1) (0.3,0.35,0.4) (0.1, 0.12, 0. 14) JP3Self-making 1-3 (20,23,26) (24,26,28) (1.9,2.0,2.1) (0.6,0.65,0.7) (0.18,0.20,0.22) omponents 1-4 The cell manufacture (15,19,23) (19,20,21) (1.7,1.8,1.9) (0.45,0.55,0.65) (0.14,0.17,0.2) Pipi-parts 2-5 (10,14,18) (16,18,20) (1.5,1.55,1.6) (0.5,0.55,0.6) (0.15,0.17,0.19) manufacture 5-8 Parts assembly (17,20,23) (19,21,23) (1.8,1.85,1.9) (0.4,0.5,0.6) (0. 14,0. 17,0.2) 3-6 Block building (10,13,16) (14,15,16) (2.0,2. 1,2.2) (0.55,0.6,0.65) (0.15,0. 17,0. 19) 6-8 Pallet assembly (8 ,11,14) (13,14,15) (1.4,1.45,1.5) (0.4,0.45,0.55) (0. 13,0. 15,0. 17) 4-7 Sections building (16,19,22) (21,23,25) (1.9,2.0,2.1) (0.6,0.7,0.8) (0.18,0.20,0.22) 7-9 Zone construction (10,12,14) (13,14,15) (2.3,2.4,2.5) (0.7,0.75,0.8) (0.19,0.21,0.23) Building berth 8-9 (4,5,6) (5,6,7) (2.4,2.5,2.6) (0.8,0.85,0.9) (0.2,0.23,0.26) healing % Here all the decision parameters are triangular fuzzy numbers represented in the form of a = (a1 , a 2 , a 3 ) . According to Definition 2.4 these triangular fuzzy numbers can also be represented in a convenient form ( ) a = (a1 , a 2 , a 3 ) = a 0 , a * , a * , where a 0 - location index number, a * = (a 0 − a) - left fuzziness index function and % ( a * = (a − a 0 ) - right fuzziness index function of a respectively. Hence the given data in the form a = a 0 , a * , a * is % % ) 61
  • 10. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Table 2 Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = a 0 , a * , a * % ( ) Fuzzy duration/d Fuzzy cost rate/10 yuan d-1 4 Activity Min. Min. Crash cost rate Normal cost Indirect Activity name index crash normal Rate cost rate Duration Duration 1-2 Material preparing (30,2,2) (32,1,1) (1.9,.0.2,0.2) (0.35,0.05,0.05) (0.12,0.02,0.02) 1-3 JP3Self-making (23,3,3) (26,2,2) (2,0.1,0.1) (0.65,0.05,0.05) (0.2,0.02,0.02) components 1-4 The cell manufacture (19,4,4) (20,1,1) (1.8,0.1,0.1) (0.55,0.1,0.1) (0.17,0.03,0.03) 2-5 Pipi-parts manufacture (14,4,4) (18,2,2) (1.55,0.05,0.05) (0.55,0.05,0.05) (0.17,0.02,0.02) 5-8 Parts assembly (20,3,3) (21,2,2) (1.85,0.05,0.05) (0.5,0.1,0.1) (0.17,0.03,0.03) 3-6 Block building (13,3,3) (15,1,1) (2.1,0.1,0.1) (0.6,0.05,0.05) (0.17,0.02,0.02) 6-8 Pallet assembly (11,3,3) (14,1,1) (1.45,0.05,0.05) (0.45,0.05,0.05) (0.15,0. 02,0.02) 4-7 Sections building (19,3,3) (23,2,2) (2,0.1,0.1) (0.7,0.1,0.1) (0.20,0.02,0.02) 7-9 Zone construction (12,2,2) (14,1,1) (2.4,0.1,0.1) (0.75,0.05,0.05) (0.21,0.02,0.02) 8-9 Building berth healing (5,1,1) (6,1,1) (2.5,0.1,0.1) (0.85,0.05,0.05) (0.23,0.03,0.03) (18, 2, 2) (21, 2, 2) (32, 1, 1) 2 5 8 (6, 1, 1) (26, 2, 2) (15, 1, 1) (14, 1, 1) 1 3 6 9 (14, 1, 1) (20, 1, 1) (23, 2, 2) 4 7 1 – 2 – 5 – 8 – 9 is the critical path and 1 – 2, 2 – 5, 5 – 8, 8 – 9 are the critical activities 62
  • 11. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Table 3 Slope of Fuzzy durations and fuzzy cost rate of shipbuilding scheduling a = a 0 , a * , a * % ( ) Normal Crash Normal cost Crash cost ∆C time time ∆t = NT − CT ∆C = CC − NC NC CC ∆t NT CT 1-2 (32,1,1) (0.35,0.05,0.05) (30,2,2) (1.9,0.2,0.2) (2,2,2) (1.55,0.2,0.2) (0.78,2,2)-II 1-3 (26,2,2) (0.65,0.05,0.05) (23,3,3) (2,0.1,0.1) (3,3,3) (1.35,0.1,0.1) (0.45,3,3) 1-4 (20,1,1) (0.55,0.1,0.1) (19,4,4) (1.8,0.1,0.1) (1,4,4) (1.25,0.1,0.1) (1.25,4,4) 2-5 (18,2,2) (0.55,0.05,0.05) (14,4,4) (1.55,0.05,0.05) (4,4,4) (1.00,0.05,0.05) (0.25,4,4)-I 5-8 (21,2,2) (0.5,0.1,0.1) (20,3,3) (1.85,0.05,0.05) (1,3,3) (1.35,0.1,0.1) (1.35,3,3)-III 3-6 (15,1,1) (0.6,0.05,0.05) (13,3,3) (2.1,0.1,0.1) (2,3,3) (1.5,0.1,0.1) (0.75,3,3) 6-8 (14,1,1) (0.45,0.05,0.05) (11,3,3) (1.45,0.05,0.05) (3,3,3) (1,0.05,0.05) (0.33,3,3) 4-7 (23,2,2) (0.7,0.1,0.1) (19,3,3) (2,0.1,0.1) (4,3,3) (1.3,0.1,0.1) (0.33,3,3) 7-9 (14,1,1) (0.75,0.05,0.05) (12,2,2) (2.4,0.1,0.1) (2,2,2) (1.65,0.1,0.1) (0.83,2,2) 8-9 (6,1,1) (0.85,0.05,0.05) (5,1,1) (2.5,0.1,0.1) (1,1,1) (1.65,0.1,0.1) (1.65,1,1)-IV Direct cost (5.95,1,1) Step: 1 Since (2-5) has least crash slope, crash (2-5) by (4 , 4, 4) (14, 4, 4) (21, 2, 2) 2 5 8 (32, 1, 1) (14, 1, 1) (6, 1, 1) (26, 2, 2) (15, 1, 1) 1 3 6 9 (20, 1, 1) (23, 2, 2) (14, 1, 1) 4 7 Step: 2 Crash (1 – 2) by (2, 2, 2) (14,4, 4) (21,2,2) 2 5 8 (30, 2,2) (6,1,1) (14,1,1) (26,2,2) (15,1,1) 1 3 6 9 (14,1,1) (20, 1,1) (23, 2,2) 4 7 63
  • 12. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 Step: 3 Crash (5 – 8) by (1, 3, 3) (14,4, 4) (20,3,3) 2 5 8 (30, 2,2) (6,1,1) (26,2,2 (15,1,1) (14,1,1) 1 3 6 9 (20, 1,1) (23, 2,2) (14,1,1) 4 7 Step: 4 Crash (8 – 10) by (1,1,1) (14,4, 4) (20,3,3) 2 5 8 (30, 2,2) (5,1,1) (14,1,1) (15,1,1) 1 (26,2,2) 3 6 9 (20, 1,1) 4 7 (23, 2,2) (14,1,1) Table-4 Direct cost Stage Crash Current duration Indirect cost Total cost = (Normal cost + Crash cost) (1) (2-5) by (4,4,4) (73,4,4,) (12.15,4,4) (11.17,4,4) (23.52,4,4) (2) (1-2) by (2,2,2) (71,4,4) (9.75,4,4) (10.93,4,4) (20.68,4,4) (3) (5-8) by (1,3,3) (70,4,4) (7.8,4,4) (10.76,4,4) (18.56,4,4) (4) (8-10) by (1,1,1) (69,4,4) (8.45,4,4) (10.53,4,4) (18.98,4,4) From the above table we can see that after stage 3 the total cost starts increasing. Hence the optimal duration is (70,4,4) and the corresponding optimal cost is (18.56,4,4) 104 yuan.. 5. Conclusion This paper investigated the fuzzy network crashing problem in the project network with several fuzzy parameters. The validity of the proposed method is examined with numerical example. The applicability of the above procedure is useful for various types of problems in which uncertain results are compassed. We can consider this approach faster and easier to complete the project in shortest possible duration. References [1]. Abbasbandy.S and Hajjari. T, (2009). “A new approach for ranking of trapezoidal fuzzy numbers”, Computers and Mathematics with Applications, 57, 413–419. [2]. Badiru, A.B., (1991) “A simulation approach to Network analysis”. Simulation, 57: 245-255. [3]. Chanas S, Kamburowski J (1981) The use of fuzzy variables in PERT. Fuzzy Sets Syst 5:11–19 [4]. Coskun, O., (1984) “Optimal probabilistic compression of PERT networks”, J. Construct. Eng. Manage., 64
  • 13. Mathematical Theory and Modeling www.iiste.org ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online) Vol.2, No.6, 2012 110: 437-446. [5]. Feng C.W., L. Liu and S.A. Burns, (2000) “Stochastic construction time-cost tradeoff analysis”. J. Comput. Civil Eng., 14: 117-126. [6]. Jin Chao-guang, Jl Zhuo-shang I , Lin Yan'- Zhao Yuan-min, and Huang Zhen-dong (2005) “Research on the fully fuzzy time-cost trade-off based on genetic algorithms”, Journal of Marine Science and Application, Vol. 4, No. 3 [7]. Johnson, G.A. and C.D. Schou, (1990) “Expediting projects in PERT with stochastic time estimates”, Project Manager. J., 21: 29-32. [8]. Liou.T.S and Wang.M.J, (1992) “Ranking fuzzy numbers with integral value”, Fuzzy sets and systems,50,3,247-255 [9]. Ming Ma, Menahem Friedman, Abraham Kandel, (1999) “A new fuzzy arithmetic, Fuzzy sets and systems”,108,83-90 [10]. Mohanaselvi S. et al. (2012) “Fuzzy Optimal Solution to Fuzzy Transportation Problem: A New Approach” / International Journal on Computer Science and Engineering (IJCSE) ISBN: 0975-3397 Vol. 4 No. 03 367-375. [11]. Pulat, P.S. and S.J. Horn, (1996) “Time-resource tradeoff problem [project scheduling]”. IEEE Trans. Eng. Manage., 43: 411-417. [12]. Rehab, R. and R.I. Carr, ( 1989) “Time-cost trade-off among related activities”, J. Construct. Eng. Manage., 115: 475-486. [13]. Shakeela Sathish, K. Ganesan (2011) “A simple approach to fuzzy critical path analysis in project networks” International Journal of Scientific & Engineering Research Volume 2, Issue 12, ISSN 2229-5518. [14]. Steve, P. Jr. and M.I. Dessouky, (1977) “Solving the project time/cost tradeoff problem using the minimal cut concept”, Manage. Sci., 24: 393-400. [15]. Van Slyke, R.M., (1963) “Monte carlo methods and the PERT problem”, Operat. Res., 33: 141-143. [16]. Wakas S. Khalaf, Leong Wah June, Mohd Rizam B. Abu Bakar and Lee Lai Soon (2011) “A Comparative Study on Time-cost Trade-off Approaches within Critical Path Method, Journal of Applied Sciences 11 (6): 920-931, ISSN 1812-5654, DOI: 10.3923/jas.2011.920.931. 65
  • 14. This academic article was published by The International Institute for Science, Technology and Education (IISTE). The IISTE is a pioneer in the Open Access Publishing service based in the U.S. and Europe. The aim of the institute is Accelerating Global Knowledge Sharing. More information about the publisher can be found in the IISTE’s homepage: http://www.iiste.org The IISTE is currently hosting more than 30 peer-reviewed academic journals and collaborating with academic institutions around the world. Prospective authors of IISTE journals can find the submission instruction on the following page: http://www.iiste.org/Journals/ The IISTE editorial team promises to the review and publish all the qualified submissions in a fast manner. All the journals articles are available online to the readers all over the world without financial, legal, or technical barriers other than those inseparable from gaining access to the internet itself. Printed version of the journals is also available upon request of readers and authors. IISTE Knowledge Sharing Partners EBSCO, Index Copernicus, Ulrich's Periodicals Directory, JournalTOCS, PKP Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Zeitschriftenbibliothek EZB, Open J-Gate, OCLC WorldCat, Universe Digtial Library , NewJour, Google Scholar