007acollege Of Administrative And Financial Sciencesassignment 3deadli ✓ Solved

007A College of Administrative and Financial Sciences Assignment 3 Deadline: 04/17/2021 @ 23:59 Academic Year: Course Name: Introduction to Operations Management Student’s Name: Course Code: MGT311 Student’s ID Number: Semester: II CRN: For Instructor’s Use only Instructor’s Name: Students’ Grade: Marks Obtained/Out of Level of Marks: High/Middle/Low Instructions – PLEASE READ THEM CAREFULLY · The Assignment must be submitted on Blackboard ( WORD format only ) via allocated folder. · Assignments submitted through email will not be accepted. · Students are advised to make their work clear and well presented, marks may be reduced for poor presentation. This includes filling your information on the cover page. · Students must mention question number clearly in their answer. · Late submission will NOT be accepted. · Avoid plagiarism, the work should be in your own words, copying from students or other resources without proper referencing will result in ZERO marks.

No exceptions. · All answered must be typed using Times New Roman (size 12, double-spaced) font. No pictures containing text will be accepted and will be considered plagiarism). · Submissions without this cover page will NOT be accepted. Learning Outcome: Demonstrate process-flow analysis, process design solutions, operations strategies, Inventory Control System and customer services in the business operation. Assignment Question(s) : (Marks 5) A public accounting firm requires the following activities for an audit: Activity Immediate Predecessor Activity time A - 3 B A 2 C - 5 D B, C 2 E A 4 F B, C 6 G E, D 5 a) Draw a network for this project? ( Marks 2.0 ) b) Make a forward pass and a backward pass to determine ES, LS, EF, and LF? ( Marks 2.0 ) c) What are the critical path? ( Marks 1.0 ) a- b- step 1 find early start, and early finish from the start of the project for each activity Activity Duration, D Early start, ES=Max of early finish of preceding activities Early finish, EF = ES + D A B C D E F G step 2 Find Maximum EF and keep it as the LF of last activities step 3 calculate LS for each activity after calculating its EF's.

Activity Duration, D Early start, ES=Max of early finish of preceding activities Early finish, EF = ES + D Late finish, LF= Min of LS of successor activities Late start, LS= LF - D Total slack= LF-EF A B C D E F G c- Critical path with 0 slack are AEG, ABDG and CDG Demonstrate process-flow analysis, process design solutions, operations strategies, Inventory Control System and customer services in the business operation. Assignment Question(s) : (Marks 5) A public accounting firm requires the following activities for an audit: Activity Immediate Predecessor Activity time A - 3 B A 2 C - 5 D B, C 2 E A 4 F B, C 6 G E, D 5 a) Draw a network for this project? ( Marks 2.0 ) b) Make a forward pass and a backward pass to determine ES, LS, EF, and LF? ( Marks 2.0 ) c) What are the critical path? ( Marks 1.0 )

Paper for above instructions

Assignment 3: Project Management for a Public Accounting Firm
Student’s Name: [Your Name]
Course Name: Introduction to Operations Management
Course Code: MGT311
Student ID Number: [Your Student ID]
Semester: II
CRN: [Your CRN]
Instructor's Name: [Instructor's Name]
Due Date: 04/17/2021

A) Network Diagram for Audit Activities


In order to perform the tasks outlined in the audit process, we first detail the appropriate network diagram. Each activity and its immediate predecessors determine how tasks relate to each other and provide insight into the overall flow of work.

Activities and Durations


Below are the activities designated by letters A to G, along with their immediate predecessors and time required for completion.
- A: No predecessor - Duration: 3 units
- B: Precedes A - Duration: 2 units
- C: No predecessor - Duration: 5 units
- D: Precedes B and C - Duration: 2 units
- E: Precedes A - Duration: 4 units
- F: Precedes B and C - Duration: 6 units
- G: Precedes E and D - Duration: 5 units
With these activities, we can draw the network diagram as follows:
```
C --+
|
|--> D -> G
|
A --+
|
E ---+
|
B-----+
|
```

B) Forward Pass and Backward Pass to Determine ES, LS, EF, and LF


To perform a forward pass, we begin at the first activities and work our way through to the final activities, calculating Early Start (ES) and Early Finish (EF) values.
1. Forward Pass Calculations
- For Activity A:
- ES = 0 (first activity)
- EF = ES + Duration = 0 + 3 = 3
- For Activity B (precedes A):
- ES = EF of A = 3
- EF = ES + Duration = 3 + 2 = 5
- For Activity C:
- ES = 0 (starts together)
- EF = ES + Duration = 0 + 5 = 5
- For Activity D (precedes B and C):
- ES = Max of EF of B and EF of C = Max(5, 5) = 5
- EF = 5 + 2 = 7
- For Activity E:
- ES = EF of A = 3
- EF = 3 + 4 = 7
- For Activity F (precedes B and C):
- ES = Max(EF of B, EF of C) = Max(5, 5) = 5
- EF = 5 + 6 = 11
- For Activity G (precedes E and D):
- ES = Max(EF of E, EF of D) = Max(7, 7) = 7
- EF = 7 + 5 = 12
2. Backward Pass Calculations
From the last activity, we track back to establish Late Finish (LF) and Late Start (LS) values.
- For Activity G:
- LF = 12 (Finished at the end of the project)
- LS = LF - Duration = 12 - 5 = 7
- For Activity F (successor of B and C):
- LF = Min(LS of G, LF of D) = Min(7, 12) = 7
- LS = LF - Duration = 7 - 6 = 1
- For Activity E:
- LF = LS of G = 7
- LS = LF - Duration = 7 - 4 = 3
- For Activity D:
- LF = LS of G = 7
- LS = LF - Duration = 7 - 2 = 5
- For Activity B:
- LF = Min(LS of D, LS of F) = Min(5, 1) = 1
- LS = LF - Duration = 1 - 2 = -1
- For Activity C:
- LF = Min(LS of D, LS of F) = 5
- LS = LF - Duration = 5 - 5 = 0
- For Activity A:
- LF = Min(LS of B, LS of E) = Min(-1, 3) = -1
- LS = LF - Duration = -1 - 3 = -4
3. Final Summary Table
| Activity | Duration | ES | EF | LS | LF |
|----------|----------|----|----|----|----|
| A | 3 | 0 | 3 | -4 | -1 |
| B | 2 | 3 | 5 | 1 | 1 |
| C | 5 | 0 | 5 | 0 | 5 |
| D | 2 | 5 | 7 | 5 | 7 |
| E | 4 | 3 | 7 | 3 | 7 |
| F | 6 | 5 | 11 | 1 | 7 |
| G | 5 | 7 | 12 | 7 | 12 |

C) Critical Path


The critical path includes the path(s) through the project that represent the longest duration without any slack.
From our calculations, we deduce:
- The critical paths identified are A → E → G and B → D → G.
- Activity paths that yield zero slack (indicating these paths must be completed on time) include:
- AEG (3 + 4 + 5 = 12)
- CDG (5 + 2 + 5 = 12)

Conclusion


In this assignment, we explored a detailed understanding of how to map out project activities through network diagrams, alongside forward and backward passes to calculate essential project timelines. Moreover, identifying the critical path provides valuable insights into which tasks are pivotal to the project's success and require close monitoring.

References


1. Project Management Institute (2021). A Guide to the Project Management Body of Knowledge (PMBOK Guide).
2. Kerzner, H. (2017). Project Management: A Systems Approach to Planning, Scheduling, and Controlling. Wiley.
3. Hill, A., & Hill, T. (2017). Operations Management. Palgrave.
4. Chopra, S., & Meindl, P. (2019). Supply Chain Management: Strategy, Planning, and Operation. Pearson.
5. Slack, N., Chambers, S., & Johnston, R. (2021). Operations Management. Pearson Education.
6. Heizer, J., & Render, B. (2017). Operations Management. Pearson.
7. Morris, P. W. G. (2013). Reconstructing Project Management. Blackwell Publishing.
8. Lynda.com (2021). Project Management Foundations. LinkedIn.
9. Turner, J. R. (2014). The Handbook of Project-Based Management. McGraw-Hill.
10. Levin, G. (2016). Critical Chain Project Management. CRC Press.
This structured approach will help facilitate the necessary project management skills relevant to operational efficiencies within the accounting domain.