1. Trang chủ
  2. » Kinh Doanh - Tiếp Thị

Quản lý sản xuất bài tập aon and aoa exercises

34 1 0
Tài liệu đã được kiểm tra trùng lặp

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Tiêu đề Quản lý sản xuất bài tập aon and aoa exercises
Trường học Unknown University
Chuyên ngành Production Management
Thể loại Bài tập
Năm xuất bản 2023
Thành phố Unknown City
Định dạng
Số trang 34
Dung lượng 504,41 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

J: 0K: 0 Step 4: Determine the Critical Path The critical path is the path with the longest total time and no delay.. O: Develop Marketing Campaign 15 daysZ: Conduct Marketing 10 days I

Trang 3

15 12

15 12

15 10

10

12 8

10 8

8 6

Trang 5

EXERCISE 1

1 Draw the project network

The project network can be drawn as AON

(Activity on Node) or AOA (Activity on Arrow) Here, we will use AON

A (Contract signed) : No prefix.

B (Survey designed) : The prefix is A.

C (Target market identified) : The prefix

is B

D (Data collection) : Prefixes are B and C.

E (Develop presentation) : The prefix is B.

F (Analyze results) : The prefix is D.

G (Demographics) : The prefix is C.

H (Presentation) : Prefixes are E, F, and G.

2 Define "burst" and "merge" operations

Trang 6

Burst activity : Is an activity from which

many other activities start In this case,

activity B is a burst activity because from B three other activities start (C, D, E)

Merge activity : Is an activity where many

other activities finish before it starts In this case, activity H is a merge activity because

it has three prefixes (E, F, G)

3 Draw the project network

Here is the AON project network:

A

|

B

/ | \

Trang 7

A (Contract signed) : Start project.

B (Survey designed) : Starts after A is

Trang 8

F (Analyze results) : Starts after D is

Burst activity : B (Survey designed)

Merge activity : H (Presentation)

Trang 9

EXERCISE 2

1 Draw the project network

The project network can be drawn as AON

(Activity on Node) or AOA (Activity on Arrow) Here, we will use AON

A (Order review) : No prefix.

B (Order standard parts) : The prefix is A.

C (Produce standard parts) : The prefix is

A

D (Design custom parts) : The prefix is A.

E (Software development) : The prefix is

Trang 10

H (Test) : Prefixes are E and G.

2 Define "burst" and "merge" operations

Burst activity : Is an activity from which

many other activities start In this case,

activity A is a burst activity because from A four other activities start (B, C, D, E)

Merge activity : Is an activity where many

other activities finish before it starts In this case, activities G and H are merge activities:

G (Assemble) : Has two prefixes (B

and F)

H (Test) : Has two prefixes (E and G).

3 Draw the project network

Here is the AON project network:

Trang 11

A (Order review) : Start project.

B (Order standard parts) : Starts after A is

Trang 12

E (Software development) : Starts after A

is completed

F (Manufacture custom parts) : Starts

after C and D are completed

G (Assemble) : Starts after B and F are

completed

H (Test) : Starts after E and G are

completed

Conclude

Burst activity : A (Order review)

Merge activities : G (Assemble) and H

(Test)

Trang 13

EXERCISE 3

Step 1: Draw the project network diagram

Based on the information table, we can draw the project network diagram as follows:

A (2 days) → B (3 days) → C (4 days)

C → D (4 days), E (1 day), F (1 day)

Trang 16

J: 0

K: 0

Step 4: Determine the Critical Path

The critical path is the path with the longest total time and no delay In this case, the critical path is:

A → B → C → D → G → H → I → J → K

The total critical path time is 22 days

Step 5: Reward/Penalty Evaluation

The project completion time is 22 days, while the target time is 17 days Therefore, the

project will be 5 days late

500

Trang 17

Since the completion time exceeds 17 days, you will not receive the bonus and will be fined

$500

Conclusion : You will be fined $500 for

completing the project 5 days later than the target time

Trang 18

C: Survey Users (4 days)

D: Identify New Features (8 days)E: Acquire Materials (12 days)F: Develop Mid-Campaign (10 days)G: Design Graphics (6 days)

H: Conduct Marketing (13 days)J: Perform Sales Calls (18 days)L: Produce Prototypes (16 days)

Trang 19

O: Develop Marketing Campaign (15 days)

Z: Conduct Marketing (10 days)

Identify dependencies between

activities : We need to know which activity

must be completed before another activity can start Let's assume the dependencies are as follows (if there is other information, you need to update):

A (Project Team Form) must be

completed before B (Interview Users) and C (Survey Users)

B (Interview Users) must be completed before D (Identify New Features)

C (Survey Users) must be completed before F (Develop Mid-Campaign)

Trang 20

D (Identify New Features) must be

completed before E (Acquire Materials) and G (Design Graphics)

E (Acquire Materials) must be

completed before L (Produce

Prototypes)

F (Develop Mid-Campaign) must be

completed before O (Develop

Marketing Campaign)

G (Design Graphics) must be

completed before H (Conduct

Marketing)

H (Conduct Marketing) must be

completed before J (Perform Sales

Calls)

Trang 21

L (Produce Prototypes) must be

completed before Z (Conduct

Marketing)

Draw a project network diagram : Based

on activities and dependencies, draw a

project network diagram

Perform Forward Pass and Backward

Pass : Calculate earliest time (ES, EF) and

latest time (LS, LF) for each activity

Calculate Slack : Determine the slack time

for each activity

Determine the Critical Path : The longest

path through the project network, which determines the project completion time

Create Gantt Chart : Shows project

progress and delays of activities not on the critical path

Trang 22

Step 1: Identify activities and

implementation time

The activities and their duration are listed above

Step 2: Identify dependencies

Suppose the dependencies are as follows:

Trang 23

L → Z

Step 3: Draw the project network diagram

Based on the activities and dependencies, we can draw a project network diagram

Step 4: Forward Pass and Backward Pass Forward Pass (Calculate ES and EF):

Trang 26

O: 0

Z: 0

Step 6: Determine the Critical Path

The critical path is the path with the longest total time and no delay In this case, the critical path is:

A → B → D → E → L → Z

The total critical path time is 53 days

Step 7: Create Gantt Chart

The Gantt Chart will display activities and their duration, and will also show the delays of

activities that are not on the critical path

Trang 27

Conclusion : The critical path of the project is

A → B → D → E → L → Z with a total project completion time of 53 days The activities on the critical path have no delay, while other activities such as C and F have delay

Trang 28

Identify dependencies between

activities : We need to know which activity

Trang 29

must be completed before another activity can start Let's assume the dependencies are as follows (if there is other information, you need to update):

A (Design) must be completed before

B (Tear Down) and C (Order Appliances)

B (Tear Down) must be completed before D (Build Cabinets)

C (Order Appliances) must be completed before F (Install Appliances)

D (Build Cabinets) must be completed before E (Install Cabinets)

E (Install Cabinets) and F (Install Appliances) must be completed before

G (Inspect)

Trang 30

Draw a project network diagram : Based

on activities and dependencies, draw a

project network diagram

Perform Forward Pass and Backward Pass : Calculate earliest time (ES, EF) and

latest time (LS, LF) for each activity

Calculate Slack : Determine the slack time

for each activity

Determine the Critical Path : The longest

path through the project network, which determines the project completion time

1

Step 1: Identify activities and

implementation time

Trang 31

The activities and their duration are listed above

Step 2: Identify dependencies

Suppose the dependencies are as follows:

Step 3: Draw the project network diagram

Based on the activities and dependencies, we can draw a project network diagram

Step 4: Forward Pass and Backward Pass

Trang 32

Forward Pass (Calculate ES and EF):

Trang 33

Step 6: Determine the Critical Path

The critical path is the path with the longest total time and no delay In this case, the critical path is:

Trang 34

A → B → D → E → G

The total critical path time is 16 days

Conclusion : The critical path of the project is

A → B → D → E → G with a total project

completion time of 16 days The activities on the critical path have no delay, while other activities such as C and F have a delay of 9 days

Ngày đăng: 12/02/2025, 13:06

🧩 Sản phẩm bạn có thể quan tâm

w