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.2, Problem 1P
A.
Summary Introduction
Interpretation: The task that is represented by Node 6 in the network diagram is to be identified
Concept Introduction: Network diagram is a graphical representation of tasks and events happening in a project. It depicts the workflow and is used to compute the total duration of the project.
B.
Summary Introduction
Interpretation: The activities that have to be completed by week 16, so as to ensure the completion of the project without any delay are to be identified.
Concept Introduction: Network diagram is a graphical representation of tasks and events happening in a project. It depicts the workflow and is used to compute the total duration of the project.
C.
Summary Introduction
Interpretation: The consequence of the activity H not being started till week 11 and the subcontractor delivering the module in 7 weeks is to be discussed.
Concept Introduction: Network diagram is a graphical representation of tasks and events happening in a project. It depicts the workflow and is used to compute the total duration of the project.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
. With activities B and C as immediate predecessors, the earliest start time for activity H must be equal to the largest of the earliest finish times for activities B and C. Thus, with EF = 6 for activity B and EF = 9 for activity C, 9 is the earliest start time for activity H (ES = 9). And with an activity time of 12 as shown in the node for activity H, what is the earliest finish time?
Task C is directly preceded by two tasks–task A and task B. Task A has an expected task completion time of five weeks and an ES time of week 6. Task B has an expected task completion time of seven weeks and an ES time of week 7. Task C has an expected task completion time of 10 weeks. The ES for activity C is?
Activities K, M and S immediately follow activity H, and their latest start times are 14, 18, and 1 The latest finish time for activity H
A. is 11.
B. is 14.
C.is 18
D.annot be determined.
( don't hand writing solution)
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
- For the network schedule shown below, which statement is true? a. This is an example of the Activity-on-Node (AON) method of network diagramming.b. Activity F can start without waiting for the completion of Activity B.c. Activity B can occur concurrently with Activity D.d. To simplify the network, Activities F and G can be combined without changing the logic.arrow_forward. True/False Statements (Tick the correct option) Selection of the critical path in network activity diagram for any project, is always focused onresult of the minimum time duration of the critical activities [ True / False ] Suppose, we have total 03 activities in the project “X”; namely L, M and N respectively. An activity “M” is the immediate successor of the activity “L”, while the activity “M” is the immediate predecessor for the activity “N”. According to this scenario, an activity “M” will be the last activity of the project “X” in the network activity diagram [True / False ] The dummy activity consumes both time and resources [True / False ] Towards the optimal solution through stepping stone method, when degeneracy problem is occurred, the next step is to focus on searching lowest value on the independent position in a non-allocated cells [True / False ] Hungarian algorithm, first convert any given assignment matrix into row reduction matrix [True / Falsearrow_forwardActivities A, B, and C are started at Week 0 and are the immediatepredecessors for Activity J. If the earliest finish times for the threeactivities are Week 11, Week 15, and Week 10, respectively, then the earlieststart time for J will be A. Week 10B. Week 11C. Week 12D. Week 15arrow_forward
- You have prepared the following schedule for a project in which the key resources is a tractor. There are three tractors available to the project. Activities A and D require one tractor to complete while activities B, C, E and F require 2 tractors.Develop a resource-constrained schedule in the loading chart that follows. Use the parallel method and heuristics given. Be sure to update each period as the computer would do. Record the early start (ES), late finish (LF) and slack (SL) for the new schedulearrow_forwardConsider the following table of activities A through E in which A is the start node and E is the stop node. Assume all activities require the same resource. On a piece of scratch paper, draw the early-start Gantt Chart associated with this table and determine the following. Assume the project is resource-constrained but not time-constrained. Assume only one resource is available and that resource can only do one activity at a time. Activities B, C and D all have the same early start date (time). Since there is only one resource, only one of the activities B, C, D can be started on the early start date. Which should be started first?arrow_forwardConsider the AON graph of a project shown in Figure 19.18.The activity times are 3, 4, 2, 5, 7, 2, 2, and 3 days for activities A1 through A8, respectively. What is the earliest completion time of the project?arrow_forward
- Consider the AON graph of a project shown in Figure 19.17. Which of the following statements is correct? a. A1 is a predecessor activity to A2. b. A2 is a successor activity of A1. c. A3 and A5 can be carried out in parallel. d. All of these statements are correct. (PICTURE ADDED)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_forwardA new project is to be completed. The following activities need to be completed in the order shown, where times are in weeks.A new project is to be completed. The following activities need to be completed in the order shown, where times are in weeks. (attached) You must use two decimal places at all times for expected times when they are not integer(a) Draw the activity network for this problem (b) Determine the Expected Times. (c) Determine the activity schedule (ES, EF, LS, and LF) as well as slack.(d) Determine and state the critical path for this project. (e) What are the expected time and the variance of the project? (f) What is the probability that the project is completed in 22 or fewer weeks. (g) What date should be set such that there is a 94% chance of completion within that time?arrow_forward
- A project consisting of eight activities satisfies the following precedence constraints: a. Construct a network for this project. (You should need only one pseudoactivity.)b. Compute the earliest and the latest starting and finishing times for each activity and identify the critical path.c. Draw a Gantt chart of the schedule for this project based on earliest starting times.arrow_forwardb) Assuming that each task is started as soon as possible, construct the corresponding resource loading diagram for the project. c) How would you rearrange the timing of project activities to reduce the fluctuation in resource demand? Assume that the overall project duration cannot be extended. Remember that the specified precedence relationships must be maintained. d) If there are only 20 workers available for the project, how would you assign workers to tasks to ensure that the project can be completed without violating the resource limit? In this case, the project duration may be extended if necessary (but without violating precedence relationships). e) Given the results from (c) and (d) above, what recommendations would you make to senior management regarding the staffing of this project, and why?arrow_forwardSuppose you have a project with a Budget at Completion (BAC) of $250,000 and a projected length of 10 months. After tracking the project for six months, you have collected the information in the table below. a. Complete the table. How do Earned Value SPI (based on $) and Earned Schedule SPI differ? b. Calculate the schedule variances for the project for both Earned Value and Earned Schedule. How do the values differ?arrow_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