Naagu's Engineering Tutorial

Showing posts with label OT. Show all posts
Showing posts with label OT. Show all posts

Sunday, 5 January 2014

Program Evaluvation & Review Technique PERT







Posted by Unknown at 22:40 1 comment:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: Network Scheduling, Operation Research, Optimization Technique, OR, OT, PERT

Critical Path Method Example

CRITICAL PATH METHOD EXAMPLE:






Posted by Unknown at 22:20 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: CPM, Critical Path Method, Network Scheduling, Operation Research, Optimization Technique, OR, OT

TIME ANALYSIS

TIME ANALYSIS:







Posted by Unknown at 22:15 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: CPM, Operation Research, Optimization Technique, OR, OT, PERT, Time Analysis
Older Posts Home
Subscribe to: Comments (Atom)

About Me

Unknown
View my complete profile

Blog Archive

  • ▼  2014 (4)
    • ▼  January (4)
      • Cost Consideration in PERT & CPM
      • Program Evaluvation & Review Technique PERT
      • Critical Path Method Example
      • TIME ANALYSIS
  • ►  2013 (26)
    • ►  December (18)
    • ►  November (8)

Popular Posts

  • Hungarian Method- Unbalanced Assignment Problem
    Q1.                    Machines                  A        B          C          D        E Jobs   1[    4         3          6          ...
  • GRAPHICAL METHOD FOR GAME THEORY
    Q1.Solve the following 2 x 3 game graphically                                Player B Player A    [ 1          3         11            ...
  • GAME THEORY : (WITHOUT SADDLE POINT)
    Q1.Solve the following Pay off Matrix                    B1         B2      A1   [   5              1      A2       3              4] ...
  • DOMINANCE PROPERTY
    Q1. Solve                         Player B                           B1    B2    B3 Player A   A1   [ 1      7        2               ...
  • GRAPHICAL METHOD FOR GAMES 2 x n / m x 2 MATRIX
    Consider the following 2 x n games            B1       B2 .............Bn A1 [    a11       a12.............a1n A2      a21       a22.....
  • Hungarian Method
    Q1. Using the following Cost matrix determine (i) Optimal Job Assignment                                                                  ...
  • Travelling Salesman Problem (TSP)
    Assuming the salesman has to visit 'n' cities.He wishes to start from a particular city visit each city once and return to his star...
  • Cost Consideration in PERT & CPM
  • Least Cost Method / Matrix Minima Method
    Q1.Obtain the initial feasible solution for the following TP using Matrix Minima Method.                  D1          D2        D3      ...
  • GAMES (2 x 2) WITHOUT SADDLE POINT
    Consider a 2 x 2 , 2 person zero sum game without any saddle point having the pay off matrix for player as           B1       B2 A1  [ a...
Picture Window theme. Powered by Blogger.