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 3P
A.
Summary Introduction
Interpretation: The network diagram showing the workflow of the given project is to be drawn.
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 critical path is to be identified by computing the earliest and the latest start and finish times.
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: A Gantt chart of the
Concept Introduction:Gantt chart is a project management tool that is a type of bar chart. It depicts the project schedule and is used for resource allocation.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A project consists of the activities in the following list. Times are given in weeks.
Activity
Preceding
Time
A
--
8
B
--
4
C
A, B
7
D
A, B
3
E
C, D
5
F
C, D
6
G
E, F
4
Draw the project network diagram.
Calculate each activity's ES, EF, LS, LF, and Slack using the project activity nodes on the project network diagram.
What is the project completion time?
Identify the critical path
A project consists of eight activities. The activity completion times and the precedence
relationships are as follows:
Activity Completion Immediate
predecessor
activities
time
(weeks)
A
50
70
C
60
D
30
A
E
40
B,C
F
20
G
60
A.D
E,F
H
50
I
G,H
Draw the project network diagram using the Activity-On-Node (AON) method for this project and
calculate the Early Start (ES), Early Finish (EF), Late Start (LS), Late Finish (LF) and Slack (SL)
for each activity.
In a project network, the critical path is the sequence of activities which has the
Multiple Choice
greatest variance.
longest duration.
most events.
most activities.
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
- Consider the following project network. Assume that the time required (in weeks) for each activity is a predictable constant and that it is given by the number along the corresponding branch. Find the earliest time, latest time, and slack for each event. Also identify the critical path Use PERT and CPM Provide table for ACTIVITY, IMMEDIATE PREDECESSOR, DURATION, , TOTAL FLOAT, FREE FLOATarrow_forwardTask 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?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
- Below is a network diagram that represents a university revamp project. The project manager analyzes this project using the critical path (CP) method. Activity durations are indicated on the networkarrow_forward11-16 Jean Walker is making plans for spring break at the beaches in Florida. In applying techniques she learned in her quantitative methods class, she has identified the activities that are necessary to prepare for her trip. The following table lists the activities and the immediate predecessors. Draw the network for this project. 11-17 The following are the activity times for the project in Problem 11-16. Find the earliest, latest, and slack times for each activity. Then find the critical path. These problems go together and are deterministic times.arrow_forwardConsider the following project network. Assume that the time required (in weeks) for each activity is a predictable constant and that it is given by the number along the corresponding branch. Find the earliest time, latest time, and slack for each event. Also identify the critical path.arrow_forward
- 3. Compute the early, late, and slack times for the activities in the network that follows, assuming a time-constrained network. Which activities are critical? What is the time-constrained project duration? Note: Recall, in the schedule resource load chart the time-constrained scheduling interval (ES through LF) has been shaded. Any resource scheduled beyond the shaded area will delay the project. Assume you have only three resources and you are using a computer that uses software that schedules projects by the parallel method and following heuristics. Schedule only one period at a time! Minimum slack Smallest duration Lowest identification number 282 Chapter 8 Scheduling Resources and Costs Keep a log of each activity change and update you make each period-e.g., period 0-1, 1-2, 2-3, etc. (Use a format similar to the one on page 259.) The log should include any changes or updates in ES and slack times each period, activities scheduled, and activities delayed. (Hint: Remember to…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_forwardDave Fletcher was able to determine the activity times for constructing his laser scanning machine. Fletcher would like to determine ES, EF, LS, LF, and slack for each activity. The total project completion time and the critical path should also be determined. Here are the activity times: Dave's earliest start (ES) and earliest finish (EF) are: Dave's latest start (LS) and latest finish (LF) are: Activity A B C D Time (weeks) 7 6 2 2 Immediate Predecessor(s) A A Activity A C D F G H Activity H Time Activity (weeks) E 4 F 6 G 10 H 6 ES 0 0 7 7 6 6 10 12 LS 14 EF 7 9 1228 10 20 LF Immediate Predecessor(s) B B C, E D, F 27arrow_forward
- The project duration in a network model can be determined by the largest value of which variable associated with the critical path?arrow_forwardA 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_forwardA 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_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