Scribd
Upload
19 views1 page

DBM 311 Practical

The document outlines the final practical examination for the B.Tech. (DT) Part III Semester I at the College of Dairy and Food Technology, Jodhpur. It includes questions on transportation problems using various methods, job sequencing for minimizing elapsed time, and definitions related to linear programming. Additionally, it covers topics such as queuing theory, differences between PERT and CPM, and constructing project networks.

Uploaded by

Manish Gurjar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views1 page

DBM 311 Practical

The document outlines the final practical examination for the B.Tech. (DT) Part III Semester I at the College of Dairy and Food Technology, Jodhpur. It includes questions on transportation problems using various methods, job sequencing for minimizing elapsed time, and definitions related to linear programming. Additionally, it covers topics such as queuing theory, differences between PERT and CPM, and constructing project networks.

Uploaded by

Manish Gurjar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

COLLEGE OF DAIRY AND FOOD TECHNOLOGY, JODHPUR

AGRICULTURE UNIVERSITY, JODHPUR


B.Tech. (DT) Part: III Semester-I
Final Practical Examination 2022-23

Course Title: ICT in Dairy Industry and Operation Research Course Code: DBM-311
Roll No______________________________ Maximum Marks: 30

__________________________________________________________________________________________

Q 1. Find initial Basic Feasible solution (BFS) of following transportation problem by North –
West Corner Rule and Vogel’s Approximation Method (VAM)

Factory W1 W2 W1 W4 Factory
Capacity (S)
F1 19 30 50 10 07
F2 70 30 40 60 09
F3 40 08 70 20 18
Work House 05 08 07 14
Requirement
Also, check it by Modi’s Method. (10)

Q 2. Consider the processing time (in minute) of 5 jobs each of which must go through the
two machine M1 & M2 order M1M2. Find sequence for jobs that minimizing total
elapsed time, also find idle time for each machine. Show the sequence on Gantt chart.
Jobs J1 J2 J3 J4 J5
M1 5 1 9 3 10
M2 2 6 7 8 4
(5)
Q 3. Comment/Spotting
(5)
Q 4. Viva-Voce
(5)
Q 5. Practical record
(5)
Comment/Spotting
1. Define “Feasible solution”, “Basic Feasible solution” and “Optimum solution” in LPP.
2. Write short note on Queuing Theory/Model.
3. Difference between PERT and CPM.
4. Solve the following LP problem by graphical method:

5. Construct a network for project whose activities and their precedence relationship are
given below:

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

-----------***************------------

You might also like