HARCOURT BUTLER TECHNICAL UNIVERSITY, KANPUR

ASSSIGNMENT (Unit-3)/OPERATIONS RESEARCH (BMA-452)

I MCA 2023-24

1.What do you understand by sequencing problem? Describe the assumptions underlying the sequencing
problems. We have nine jobs, each of which must be processed on two machines I and II in order I-II. The
processing times (in hrs) for the jobs are given below:

Job A B C D E F G H I

Machine I 4 7 6 11 8 10 9 7 6

Machine II 8 10 9 6 5 11 5 10 13

Determine the sequence for the jobs that will minimize the total elapsed time.

2. What is "no passing rule" in a sequencing algorithm?

Six jobs are to be processed on two machines A and then on machine B. Time in hours taken by each job
on each machine is given below:

Jobs → 1 2 3 4 5 6

Machine A 5 3 2 10 12 6
Machine B 3 2 5 11 10 7
Determine the optimum sequence of jobs that minimizes the total elapsed time to complete the jobs. Also
compute the minimum time.

3. What is CPM? What are the essential steps in CPM for project planning?

4. Using graphical method calculate the minimum time needed to process jobs 1 and 2 on
five machines A, B, C, D and E, i.e. for each machine find the job which should done
first. Also calculate the total time needed to calculate both jobs.

Machines
Job 1 Sequence A B C D E
Time(hrs) 6 8 4 12 4

Job 2 Sequence B C A D E
Time(hrs) 10 8 6 4 12
 5. A project consists of a series of tasks levelled A, B, ….H, I with the following
constraints. The notation X<Y means that the task X must be completed before Y is
started. With the notation, A< D, E; B, D < F; C < G; B< H; F, G < I,
Draw the network diagram of this project, find the minimum time of completion of the
project, Float for each activity, EST, LST, EFT, LFT and critical path of the project when the
time (in days) of completion of each task is as follows:

Task A B C D E F G H I
Time 23 8 20 16 24 18 19 4 10
(days)
6. Find the sequence that minimizes the total elapsed time (in hours) required to complete
the following jobs on three machines M1, M2, M3 in the order M1---> M2---> M3:

Jobs---> A B C D E
Machines
M1 6 8 7 10 6
M2 3 2 5 6 4
M3 4 8 6 7 8

Find the minimum elapsed time and the idle time for each machine.

7. Assuming that the expected times are normally distributed; find the probability of
meeting the scheduled time as given for the network.
Activity Days
(i-j) Optimistic Time Most likely Time Pessimistic Time
to tm tp
1-2 2 5 14
1-3 9 12 15
2-4 5 14 17
3-4 2 5 12
4-5 6 6 12
3-5 8 17 20

Scheduled project completion time is 30 days. Also find the date on which the project
manager can complete the project with a probability of 0.90.
8. Consider the following project.
Time estimates in weeks
Activity Optimistic Most likely Pessimistic Predecessor
Time Time Time
to tm tp

A 3 6 9 None
B 2 5 8 None
 C 2 4 6 A
D 2 3 10 B
E 1 3 11 B
F 4 6 8 C,D
G 1 5 15 E

Find the critical path and standard deviation for each activity. Also find the probability of
completing the project by 18 weeks.

9. What are the objectives of CPM and PERT? Describe the rules for network construction and
differentiate between CPM and PERT.
A project has the following characteristics:

Optimistic Most likely Pessimistic

Activity time (days) t0 time tm time tp
1-2 2 5 14
1-6 2 5 8
2-3 5 11 29
2-4 1 4 7
3-5 5 11 17
4-5 2 5 14
6-7 3 9 27
5-8 2 2 8
7-8 7 13 31
(i) Draw the network diagram,
(ii) Find the expected time and variance of each activity.
(iii) Calculate EST and LFT and mark them on the network diagram.
(iv) Find the critical path and total project duration

10. Construct the network for the following activity data:

Activity: A B C D E F G H I J K L
Predecessor: - A A B C C E F G,H G,H I J