Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 10.5, Problem 17P
Summary Introduction
Interpretation: The probability that that node 6 representing the completion of activities A, C, E and F is reached before 12 days is to be computed.
Concept Introduction: Program Evaluation and review technique is a planning and control tool, wherein the work flow of various activities of a project are graphically represented and analyzed. This technique is distinct in the way that it deals with uncertainty in the activity completion times.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
You are required to design a 2-story steel building. The building is a logistic warehouse located in Chicago,IL. Warehouse activity and storage will occur on the first level and offices to manage the logistic warehouse are located on the second level.
a) Identify the constraint of this project.
Activities A, B, C, and D are on the critical path of the network diagram below: The cost and duration of performing these activities is: Task A: $2,500 in 4 days Task B: $5,000 in 3 days Task C: $10,000 in 6 days Task D: $8,000 in 8 days At the end of day 10, tasks A and B are complete and task C is 25% complete. The amount spent thus far is $11,000. Given this information, how will you summarize the status of the project?
Ahead of schedule, over budget
Ahead of schedule, under budget
Behind schedule, under budget
Behind schedule, over budget
Consider the following TABLE
Activity
preceding activity
Duration (days
A
-
B
-
C
A
D
C
E
B &C
Required
Discuss the rules for drawing networks and illustrate the above by drawing its network.
Chapter 10 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 10.2 - Prob. 1PCh. 10.2 - Prob. 2PCh. 10.2 - Prob. 3PCh. 10.2 - Prob. 4PCh. 10.2 - Prob. 5PCh. 10.2 - Prob. 6PCh. 10.3 - Prob. 7PCh. 10.3 - Prob. 8PCh. 10.3 - Prob. 9PCh. 10.3 - Prob. 10P
Ch. 10.4 - Prob. 11PCh. 10.4 - Prob. 12PCh. 10.4 - Prob. 13PCh. 10.4 - Prob. 14PCh. 10.4 - Prob. 15PCh. 10.4 - Prob. 16PCh. 10.5 - Prob. 17PCh. 10.5 - Prob. 18PCh. 10.5 - Prob. 19PCh. 10.5 - Prob. 20PCh. 10.5 - Prob. 21PCh. 10.6 - Prob. 22PCh. 10.6 - Prob. 23PCh. 10.6 - Prob. 24PCh. 10.6 - Prob. 25PCh. 10 - Prob. 26APCh. 10 - Prob. 27APCh. 10 - Prob. 28APCh. 10 - Prob. 29APCh. 10 - Prob. 30AP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- In making a forward pass through a network, three activities are immediate predecessors for activity T and one following activity. What is the late start time for activity T? Group of answer choices: - the LS of the following activity plus the activity time of T - the smallest EF for the three activities that are immediate predecessors for activity T - the LF of the following activity minus the activity time of T - the LS of the following activity minus the activity time of T - the largest EF for the three activities that are immediate predecessors for activity Tarrow_forwardPlease do not give solution in image formate thanku. There are four critical paths in a network. A-B-C-D-E, A-F-E, A-B-H-J-K-E and A-S-T-E. Each activity in this network can be crashed by a maximum of 4 weeks. The crashing cost (per week), for the first week (crashing first time), for activity A is: $400, E is $415 and all other activities is : $100 (per week per activity). The crashing cost, second week and onwards(crashing second time), for activity A is $1000 per week, E is $1200 per week and for all other activities is $200 per activity per week. You have a maximum crashing budget of $2505. The maximum possible reduction in the project duration will be: a. 2 weeks b. 3 weeks c. 4 weeks d. 5 weeks e. 6 weeksarrow_forwardThere are four critical paths in a network. A-B-C-D-E, A-F-E, A-B-H-J-K-E and A-S-T-E. Each activity in this network can be crashed by a maximum of 6 weeks. The crashing cost (per week), for the first week (crashing first time), for activity A is: $480, E is $495 and all other activities is : $120 (per week per activity). The crashing cost, second week and onwards(crashing second time), for activity A is $1200 per week, E is $1440 per week and for all other activities is $240 per activity per week. You have a maximum crashing budget of $3005. The maximum possible reduction in the project duration will be: a. 6 weeks b. 3 weeks c. 2 week d. 5 weeks e. 4 weeksarrow_forward
- George is camped deep in the jungle, and he wants to make his way back to the coast and civilization. Each of the paths he can take through the jungle has obstacles that can delay him, including hostile natives, wild animals, dense forests and vegetation, swamps, rivers and streams, snakes, insects, and mountains. Following is the network of paths that George can take, with the time (in days) to travel each branch: Determine the shortest (time) path for George to take and indicate the total time.arrow_forwardA project consisting of eight activities satisfies the following precedence constraints:Time ImmediateActivity (weeks) PredecessorsA 3B 5AC 1AD 4 B, CE 3BF 3 E, DG 2FH 4 E, Da. Construct a network for this project. (You should need only one pseudoactivity.)arrow_forwardFor the activity on arrow network information given below (activity durations are givenin the table under part b): a. Compute the earliest event occurrence time (TEj), the latest allowable eventoccurrence time (TLj), and the event slack (ESj) for all nodes/events. b. Compute the four schedule dates (ESDij, EFDij, LSDij, LFDij) and the floats(TFij, FFij) for all activities.arrow_forward
- A contractor needs to complete a project. The project involves 10 activities (labeled A, B, ..., J) with precedence relationship in network below. The estimate (in weeks) of the duration of each activityis in the table below. a. The mean and variance of the activity time for A~F are given in the table. Find the mean and variance of the activity time for the remaining arcs.b. Identify the critical path and then compute the mean and variance of the project completion time.c. What is the probability that the project is completed between 32 and 36 weeks?d. What completion time should the contractor claims to be 95% sure of completing the project by then?arrow_forwardConsider Table 6-3. All duration estimates or estimated times are in weeks, and the networkproceeds from Node 1 to Node 8. (Note that you can easily change this table to createmultiple exercises.)a. Draw an AOA network diagram representing the project. Put the node numbers in circlesand draw arrows from node to node, labeling each arrow with the activity letter andestimated time.b. Identify all of the paths on the network diagram and note how long they are, using Figure 6-8as a guide for how to represent each path.c. What is the critical path for this project and how long is it?d. What is the shortest possible time needed to complete this project?arrow_forwardThere are four critical paths in a network. A-B-C-D-E, A-F-E, A-B-H-J-K-E and A-S-T-E. Each activity in this network can be crashed by a maximum of 4 weeks. The crashing cost (per week), for the first week, for activity A is: $560, E is $565 and all other activities is : $140 (per week per activity). The crashing cost, second week and onwards, for activity A is $1120 per week, E is $1400 per week and for all other activities is $420 per activity per week. You have a maximum crashing budget of $2385. The maximum possible reduction in the project duration will be: a. 5 weeks b. 3 weeks c. 4 weeks d. 2 weeks e. 1 weekarrow_forward
- A farm owner is going to erect a maintenance building with a connecting electrical generator and water tank. The activities, activity descriptions, and estimated durations are given in the following table: (Notice that the activities are defined not by node numbers but by activity descriptions. This alternative form of expressing activities and precedence relationships is often used in CPM/PERT.) Construct the network for this project, identify the critical path, and determine the project duration time.arrow_forwardTOPIC: MARKOV CHAINSThe time variation from one day to the next is assumed to form a Markov chain, with the transition matrixfollowing:[table]Given that today Sunday is cloudy, what is the probability that Wednesday will be sunny?arrow_forward. You are managing a badminton tournament and need a game official for each of the four games. All the games occur at the same time in four different departments. The departments are Education, Accountancy, Nursing and IT. The four game officials live in different parts of Abra and will need to travel to the games and submit a travel expense according to the table below. The assignment is one official to one game location. Formulate this assignment question as an LP question to minimize cost to send the officials to their games. Game Locations Official Education Accountancy Nursing IT 1 60 155 190 215 2 75 200 120 105 3 110 180 130 165 4 55 122 110 70arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY