SAMPLE STUDY MATERIAL. GATE, IES & PSUs Civil Engineering

Similar documents

A scheme developed by Du Pont to figure out

11/8/2018. Overview. PERT / CPM Part 2

Chapter 16: Program Evaluation and Review Techniques (PERT)

Project Planning & Control Prof. Koshy Varghese Department of Civil Engineering Indian Institute of Technology, Madras

PROGRAMMING CPM. Network Analysis. Goal:

4. Network Calculations

(1) The starting point is the precedence table (aka dependence table) Immediately preceding activities

ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1

Project Time Planning. Ahmed Elyamany, PhD

Time allowed: 1.5 hours

Time Planning and Control. Time-Scaled Network

M.SC. MATHEMATICS - II YEAR

Network analysis. A project is a temporary endeavor undertaken to create a "unique" product or service

Chapter 7 (Cont d) PERT

Sample Chapter. Basic Hard Systems. Engineering: Part I

Using Neutrosophic Sets to Obtain PERT Three-Times Estimates in Project Management

QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost

Neutrosophic Sets, Project, Project Management, Gantt chart, CPM, PERT, Three-Time Estimate.

Time Planning and Control

Benefits of PERT/CPM. 2018, Jayant Rajgopal

Project Management Prof. Raghunandan Sengupta Department of Industrial and Management Engineering Indian Institute of Technology Kanpur

CHAPTER 12. (The interpretation of the symbols used in the equations is given in page 3)

A Critical Path Problem Using Triangular Neutrosophic Number

A Critical Path Problem in Neutrosophic Environment

II BSc(Information Technology)-[ ] Semester-III Allied:Computer Based Optimization Techniques-312C Multiple Choice Questions.

Network Techniques - I. t 5 4

THE NONSIMULTANEITY CONSTRAINT IN NETWORK-BASED PROJECT MANAGEMENT SYSTEMS A THESIS. The Faculty of the Graduate Division. J.

Embedded Systems - FS 2018

BPSC Main Exam 2019 ASSISTANT ENGINEER. Test 4. CIVIL ENGINEERING Subjective Paper. Detailed Solutions

SOLVING STOCHASTIC PERT NETWORKS EXACTLY USING HYBRID BAYESIAN NETWORKS

Duration of online examination will be of 1 Hour 20 minutes (80 minutes).

07/09/2011. A.AMRANI-ZOUGGAR IMS-Lab, University Bordeaux1. These products specific management

Project management model for constructing a renewable energy plant

Toward the Resolution of Resource Conflict in a MPL-CCPM Representation Approach

Solving Fuzzy PERT Using Gradual Real Numbers

A Critical Path Problem Using Triangular Neutrosophic Number

There are three priority driven approaches that we will look at

MEI Decision Mathematics 1

56:171 Operations Research Midterm Exam--15 October 2002

ABSTRACT TIMING VERIFICATION AND OPTIMIZATION OF CIRCUITS WITH LEVEL-SENSITIVE LATCHES. by Timothy Michael Burks

A Global Constraint for Parallelizing the Execution of Task Sets in Non-Preemptive Scheduling

Operations Research: Introduction. Concept of a Model

As Soon As Probable. O. Maler, J.-F. Kempf, M. Bozga. March 15, VERIMAG Grenoble, France

Network Techniques - II.

Computers and Mathematics with Applications. Project management for arbitrary random durations and cost attributes by applying network approaches

CMSC 451: Lecture 7 Greedy Algorithms for Scheduling Tuesday, Sep 19, 2017

Operation management

Qi Jian-xun,Sun Dedong

A comparison of sequencing formulations in a constraint generation procedure for avionics scheduling

Last class: Today: Threads. CPU Scheduling

Simulation & Modeling Event-Oriented Simulations

CHAPTER 6. WORK DESIGN and ORGANIZATIONAL PERFORMANCE, WORK MEASUREMENT

MULTIPLE CHOICE QUESTIONS DECISION SCIENCE

EE382V: System-on-a-Chip (SoC) Design

EE382V-ICS: System-on-a-Chip (SoC) Design

SYMBIOSIS CENTRE FOR DISTANCE LEARNING (SCDL) Subject: production and operations management

Flow Shop and Job Shop Models

2. Linear Programming Problem

VLSI System Design Part V : High-Level Synthesis(2) Oct Feb.2007

Single Machine Problems Polynomial Cases

Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations

RCPSP Single Machine Problems

Seismic Analysis of Structures Prof. T.K. Datta Department of Civil Engineering Indian Institute of Technology, Delhi. Lecture 03 Seismology (Contd.

Efficient Workplan Management in Maintenance Tasks

1 Basic Definitions. 2 Proof By Contradiction. 3 Exchange Argument

3. Scheduling issues. Common approaches 3. Common approaches 1. Preemption vs. non preemption. Common approaches 2. Further definitions

2. Project management

...(iii), x 2 Example 7: Geetha Perfume Company produces both perfumes and body spray from two flower extracts F 1. The following data is provided:

Total No. of Questions : 10] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC Second Year STATISTICS. Statistical Quality Control

Real-Time Systems. Event-Driven Scheduling

What is SSA? each assignment to a variable is given a unique name all of the uses reached by that assignment are renamed

Using Method of Moments in Schedule Risk Analysis

Module 5: CPU Scheduling

Fluids Engineering. Pipeline Systems 2. Course teacher Dr. M. Mahbubur Razzaque Professor Department of Mechanical Engineering BUET

Chapter 6: CPU Scheduling

Project scheduling with calendars

Activity Predecessors Time (months) A - 2 B A 6 C A 4 D B 4 E C 2 F B,D 1 G D,E 2 H C 1. dummy0 C4 E2

ALG 5.4. Lexicographical Search: Applied to Scheduling Theory. Professor John Reif

56:171 Fall 2002 Operations Research Quizzes with Solutions

CPU scheduling. CPU Scheduling

Trajectory planning and feedforward design for electromechanical motion systems version 2

Time Petri Nets. Miriam Zia School of Computer Science McGill University

Energy-efficient Scheduling Algorithms for Real-time Parallel Applications on Heterogeneous Distributed Embedded Systems

Review Exercise 2. 1 a Chemical A 5x+ Chemical B 2x+ 2y12 [ x+ Chemical C [ 4 12]

Information System Design IT60105

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

57:022 Principles of Design II Midterm Exam #2 Solutions

Graphical and Computer Methods

SECTION AGGREGATE OR GRANULAR SUBBASE

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

Professional Agreement Invoice and Progress Report

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

GIS Based Project Management Information System for Infrastructure Projects - A Review Paper

Cell Transmission Models

Comp 204: Computer Systems and Their Implementation. Lecture 11: Scheduling cont d

Design and Analysis of Experiments Prof. Jhareswar Maiti Department of Industrial and Systems Engineering Indian Institute of Technology, Kharagpur


Scheduling with Constraint Programming. Job Shop Cumulative Job Shop

TDDB68 Concurrent programming and operating systems. Lecture: CPU Scheduling II

Transcription:

SAMPLE STUDY MATERIAL Postal Correspondence Course GATE, IES & PSUs Civil Engineering CPM & CONSTRUCTION EQUIPMENT

C O N T E N T 1. CPM AND PERT... 03-16 2. CRASHING OF NETWORK... 17-20 3. ENGINEERING ECONOMY 21-31 4. ENGINEERING FUNDAMENTAL OF EQUIPMENTS... 32-36 5. CONSTRUCTION EQUIPMENT... 37-63 1. EXCAVATION & TRANSPORTATION EQUIPMENT 2. HAULING AND CONVEYING EQUIPMENTS 3. CONVEYING EQUIPMENT 4. COMPACTION EQUIPMENT 5. DRILLING EQUIPMENT 6. BLASTING ROCKS 7. CRUSHERS 6. HOISTING EQUIPMENT 64-65 7. CONCRETING EQUIPMENT.. 66-69 8. IES PREVIOUS YEAR QUESTION 70-108 9. PRACTICE SET WITH SOLUTION 109-111

CHAPTER-1 CPM & PERT PROJECT: A project is made up of a group of interrelated work activities constrained by a specific scope, budget and schedule to achieve the specific goals of an agency. Projects are defined by their scope, budget and schedule. Project Management: Objective: To minimize the project cost while satisfactorily completing the task. Optimum use of available resources. Project cost involves (a) material cost (b) construction cost. Various Phases of a Project: Resources includes (a) Men (b) Materials (c) Machineries (d) Money 1. Planning: Efficient use of machineries, material, men etc. along with minimizing resource cost is the basic aim of this phase. It involves proper sequencing of events. 2. Scheduling : Scheduling is basically the allocation of resources. Process of sequencing various events of a project within a timeframe. Required for continuous tracking of project, resource mobilization etc. Useful in minimizing the cost and optimal use of resources. Assigning dates for start and completion of each activity in logical sequence in systematic manner. 3. Controlling & Monitoring : Execution of the project is monitored for its timely completion. As per requirement re-planning, rescheduling is done by applying suitable corrective measures, which is called updating of individual activities To monitor project cost, progress of construction, etc. Note: The first method that was developed for planning a project is called project planning & scheduling (PPS). Critical path method (CPM) came later and are generally used these days for similar type of project and it has a deterministic approach. TECHNIQUE USED FOR PROJECT MANAGEMENT:

(I) Bart chart: [Characteristic] [Developed by Gantt in 1900 As] (i) It is simple & easy to understand. (ii) A bar chart consist of two co ordinate axes one representing the time elapsed and other represent the jobs or activities to be performed. (iii) It is a pictorial representation. (iv) The length of bar chart represents its time of completion. Whereas shaded width of bar represents the percentage completion of that particular of activity. (v) It is used only for small scale project. Short comings of bar chart: i) Lack of details: Only major actives are shown in a bar chart and sub activities cannot be separated out. It too many activities or tasks are shown separately it becomes clumsy. ii) Review of project progress: It cannot be used as a control device as it does not shows the progress of work iii) Activity inter relationship: In a project there can be several activities which may start concurrently, bar char cannot differentiate such activities. iv) Time uncertainties: Bar charts are not useful in the project where there are uncertainties in determination of estimation of time required for completion of various activities. v) Bar chart cannot differentiate between critical and non critical activities. Hence updating of individual activities of resources smoothing and resource leveling cannot be done. (II) Milestone chart: i) It is an improvement over the original Gantt chart. Milestones are specific points in time which mark the completion of certain portions of the main activity. ii) It gives idea about completion of sub activities.

iii) GATE, IES & PSUs ( 2015-16) Controlling can be better achieved but still activity inters relationship and accountability of time uncertainly cannot be depicted. This can be achieved by network method discussed further. Network Methods CPM & PERT are two major network methods. Other network methods are like UNETICS, LESS, TOPS and SCANS. However PERT & CPM are major network method. CPM: - Critical Path Method It involves deterministic approach. Used for repetitive project, e.g. construction of a building. PERT: - Project / Programme Evaluation and Review Technique. It involves probabilistic approach. Used for research and development projects, e.g. Missile Programme. Elements of a Network 1. Activity : It represents execution of a specific job. It requires time and resources. For its completion. It is represented by an arrow. e.g. - Brickwork, Plastering etc. Brickwork Plastering Activities performed prior to an activity under consideration are called as predecessor activities to that activity. Activities performed after completion of an activity under consideration are called as successor activities to that activity. A is predecessor activity of B. C is successor activity of B. AoA system (Activity on arrow system) is represented by arrow between events. AoN system (Activity on Node) system is represented by activity on nodes. Events have no place in such system. 2. Event : It represents start or end of a task. It is generally represented by a circle. Beginning of an activity is called tail event and denoted by i-node.

Completion of an activity is called head event and denoted by j-node. Add (8) Events which occurred prior to an event under consideration are called as predecessor event to that event. Events which occur after an event under consideration are called as successor event to that event. Events are represented by nodes in a network. It may have the following shapes. (a) Circular (b) Rectangular (c) Square (d) Oval There can only be one tail event and one head event in a project. (1), (2) are predecessors event to (3). (6), (7) are successor events to (3). Event (2), (3), (4), (5) & (6) are dual role events. 3. Dummy : It denotes an artificial activity. It is represented by a dotted arrow. It indicates that an activity following the dummy cannot be started until the activities preceding the dummy are not completed. It does not require time or resources. It denotes depending among the activities (a) (b) Objective: To establish logical relationship between activities. To avoid grammatical mistake. Type (a) Use of Dummy here gives both activities a unique identification.

Dummies are used to show predecessor relationship but if that relation is perfectly established inside the network, then such dummy is a redundant & should be removed. It dummy is only incoming arrow to a node then it can be removed provided there is no logical or grammatical error. Rule of Network: In every project network, there should be only one initial and final event. Events occur in a particular order and any event cannot occur until all the predecessor events are not completed. Time flow is preferably assumed from left to right. Normally, arrows should not cross each other. If it is necessary to cross each other, the arrow should make a bridge over the other. Every activity should have its own i-j node, such that value of j-node should always be greater than i-node. Number of arrows should be equal to the number of activities. An event cannot occur twice. Fulkerson s rule for numbering the node of events: 1. The initial event is numbered as (1, 10 etc.) 2. Now all arrows coming out of initial event (1, 10 etc.) are removed. Thus one or more initial events are created which is numbered as (2, 3,4 etc.or 20,30,40 etc ) 3. Step 2 is repeated until the final event of the network is not numbered. Errors in Network: 1. Looping Error: It generates logical problem in the network.

2. Dangling Error: Each network should contain only one initial event and one final event. 3. Wagon Wheel Error: It generates logical error in network. CPM NETWORK: Critical Path: It is defined as the path of longest project duration. The activities lying in critical path are called critical activities. Hence critical activities signify that any delay in critical activities will ultimately delay the overall project. All other activities which are not on critical path will not affect total duration of project. Alternatively, it can be stated that critical path is the shortest possible duration to complete the job/project. Computation of project time: (i) (ii) The box at the i-node contains two terms: EOT- Earliest occurrence time at i-node. LOT- Latest occurrence time at i-node. ti- j EOT : " " Duration of Activity.

It is the earliest time when an event can occur. In general,it can be written as: ()() EOT j EOT i...(i) ti j To compute the (EOT )at all the nodes: i. Assume the value of EOT LOT at first node i.e. at 1 equal to O O ii. Now, calculate the value at the other nodes using above equation () EOT0 2 t 2 t 2 (at node only one activity merges) () EOT0 2 t1 t1 OR () EOTMaximumof(,()) t t t t2 t3 () t2 t3 3 1 2 3 Then, proceed with maximum value of (EOT) 2 (for illustration both values is taken here for calculation at (EOT) 4 ) ()() t1 t4 t1 t4 (EOT) = Maximum of ()() t t t t t t ()() t2 t5 t2 t5 4 2 3 4 2 3 4 Hence, in general it can be stated that event. e.g. ()() EOT j EOT i ti j max. if more than one activities merge at an Total project time is given by (EOT) 4 or EOT of last event. Thus, it is calculated by forward method.

Proceed with previous figure It is defined as the latest possible time at which event may take place without affecting the total project duration which is calculated by forward pass method. Hence,(LOT) of last event is taken equal to (EOT) of last event. Hence, ()() EOT 4 LOT 4 T In general, ()() LOT i LOT j ti j..(ii) (ii) (LOT) 3 = T t 4 backward direction] T t5 T t5 () T t t T t t calculated at 1 4 3 4 3 It is also known as backward pass method. is initial event, hence it should be equal to (EOT) 1 =0 ] Hence,it can be stated as : ()() LOT i LOT j ti j activity merges at an event. Now calculate values at other nodes using above equation [only one activity meets at this event while tracing in min. (LOT) 2 =Minimum of Similarly, (LOT) 1 =Minimum of values [since, it - Minimum of all the values, if more than one

e.g. using the previous example: GATE, IES & PSUs ( 2015-16) Notes: I. Nodes having some values of EOT and LOT are called as critical nodes. And the paths connecting the critical nodes are called as critical path. II. A project may have more than one critical paths, but the time taken by each critical paths will be same. Activity time in CPM: 1. EST: Earliest Start Time: It is the earliest possible time at which an activity may start. ()() EST i j EOT i 2. EFT: Earliest Finish Time: It is the earliest possible time at which an activity may finish ()() EFT i j EOT i tij 3. LST : Latest Start Time: any delay in project duration. It is the latest possible time at which an activity may start without ()() LST i j LOT j tij 4. LFT : Latest Finish Time: It is the latest possible time at which an activity may finish without any delay in project duration. ()() LFT i j LOT j

Float: The range within which the start time or finish time of any activity may vary such that it doesn t affect the completion of project. It is of four types: 1. Total Float (F t ): It is given by the difference of maximum available time of an activity and the activity duration. F ()() LOT EOT t t j i ij It affects the total float of succeeding and preceding activities. 2. Free Float (F f ) : It is given by the difference of available time when all events start as early as possible and the activity duration. F ()() EOT EOT t f j i ij It does not affect the succeeding activities. 3. Independent Float (F ind. ): activity starts as latest as possible () LOT i () EOT j and the activity duration. It is given by the difference of minimum available time.i.e. F EOT LOT t. ()() ind j i ij and finishes as early as possible activity. In some cases, it does not affect succeeding activity or preceding If the value of it comes to be negative, it is taken as zero. 4. Interfering Float (F int. ): It is the difference of total float and free float. F F F int. t f Notes: It is equal to head event slack.

Here, floats indicated on arrow can be obtained by difference of value at head and tail of arrow and activity duration (t ij ) All the four floats of each activity on critical path are zero. Slack (s): It denotes the range within which an event can occur. i.e. s () LOT EOT i i s () LOT EOT j j event. The minimum value of slack is zero i.e.it indicates about critical (a) A-O-A System In this system generally activity is written on one side of arrow and activity duration on other side of arrow. Dummies are also used as per network requirement. Also number of dummies should be kept minimum. Nodes represent events. (b) A-O-N System :

Activity along with its duration and its identification number are written in a rectangular box as shown above. EST, LST, EFT & LFT of an activity is written as shown above. It eliminates uses of dummies. It eliminated events. PERT NETWORK: PERT: Project/Programme Evaluation and Review Technique. It is used in the cases of Research and Development Projects, projects which involve uncertainty in time estimation. It involves three types of activity duration: PERT is event oriented programming technique in which time cannot be estimated accurately. (a) Optimistic Time (T o ): It is the minimum time required for an activity assuming ideal conditions during execution. (b) Pessimistic Time (T p ): It is the maximum time required for an activity if unfavorable conditions exist during execution. (c) Most Likely Time (T m ): It signifies most frequent occurrence time of an activity. It is generally estimated based on past experience of executing the same activity many a times. Figure: Probability distribution curve for activity duration It represents a situation in which things are as usual and none of the activities is non-scheduled. In PERT network analysis, (beta)-distribution curve is used, because this curve yields good result for most of the activities. Elements of (beta)-distribution: B distribution is of two types. (i) Skew right (less time ie optimistic estimation)

(ii) Skew right (more time ie pessimistic estimation) 1. Expected mean time of an activity(t e ): T e T 4T T 6 o m p 2. Standard Deviation of an activity( ): T p T 3. Variance of an activity( ): 6 o 2 Tp T0 or, 6 Critical Path: The definition of critical path in PERT Network is same as that for CPM Network. For calculation purpose all the three time,t o, T p & T m are converted into expected time (T e ) [it will be used in place of activity time t i-j ] Hence, 2 Note: When all the time co-ordinates i.e. T p, T m & T 0 coincides such that variance is O then the duration of the activity becomes certain and deterministic i.e. it changes into CPM. Hence it can

be concluded that PERT is a general case where as CPM is the particular case of PERT. Earliest expected occurrence time (T E ): It is same as that of earliest occurrence time (EOT) of CPM. Hence it is given as : event. ()() T E j T E i t i j max. When more than one activity merges at an Latest Allowable occurrence time (T L ): It is same as that of latest occurrence time (LOT) of CPM. Hence it is given as: ()() T L i T L j t i j min. When more than one activity merges at an event. Scheduled completion time (T s ) of project is taken equal to T L of the last event. SLACK(s): It denotes the range within which an event can occur, same as that of CPM Network: i.e. S () T &() T S T T i L E i j L E j Unlike the value of slack in CPM Network, in PERT network, the value of slack may be positive, zero, negative. 1. Positive Slack (s) > 0; i.e. Project is ahead of schedule, hence excess resources are available. 2. Zero Slack (s) = 0; i.e. Project is running as per schedule, hence resources are adequately available. 3. Negative Slack (s) < 0; i.e. Project is behind schedule; hence resources are not adequately available. Notes:

Events which have least value of slack are treated as critical event. And the path joining critical events is called critical path. To Buy Postal Correspondenece Package call at 0-9990657855