4 S.L.Loney : An elementary treatise on the Dynamics of a particle and rigid bodies.,Cambridge University press 1956. 5 Mechanics : Dr. L.K.Patel. HEMCHANDRACHARYA NORTH GUJARAT UNIVERSITY, PATAN Programme code : Programme Name : Mathematics BSMAT Course Code Semester : 6 BSMAT607CC Operations Research-Ii(Oii) Course type : Total Credit : 03 Core Course Teaching time (hours) Examination Marking scheme Theory Practical Internal External Total (hrs) (hrs) (Marks) (Marks) 4 X 15 = 60 30 70 ( Paper of 3 hrs) 100 Topic Marks Unit Content Hrs. Credit No. W + % No. 1. Network Models- Concept of Networks. 3 Transportation Problem- Introduction, general method of a T.P., unbounded T.P. NWCM, Least cost method, VAM methods to find the initial solution, Dual of a T.P. and MODI method, degeneracy in a T.P., variatons in T.P.- Maximization T.P. and prohibited routes. Assignment Problem- General model of A.P.(A.P. as a special case of a T.P.) Hungarian Method of solving a A.P., variations in a A.P.- maximization, prohibited assignments. 2. Sequencing Problem : Methods of sequencing, Johnson’s Algorithm for a two machine problem, three machine problem and M-machine problem, Processing Two jobs through M- machines
4 S.L.Loney : An elementary treatise on the Dynamics of a particle and rigid bodies.,Cambridge University press 1956. 5 Mechanics : Dr. L.K.Patel. HEMCHANDRACHARYA NORTH GUJARAT UNIVERSITY, PATAN Programme code : BSMAT Programme Name : Mathematics Course Code BSMAT607CC Semester : 6 Operations Research-Ii(Oii) Course type : Core Course Total Credit : 03 Teaching time (hours) Examination Marking scheme Theory (hrs) Practical (hrs) Internal (Marks) External Total (Marks) 4 X 15 = 60 30 70 ( Paper of 3 hrs) 100 Unit No. Topic No. Content Hrs. Marks W + % Credit 1. Network Models- Concept of Networks. Transportation Problem- Introduction, general method of a T.P., unbounded T.P. NWCM, Least cost method, VAM methods to find the initial solution, Dual of a T.P. and MODI method, degeneracy in a T.P., variatons in T.P.- Maximization T.P. and prohibited routes. Assignment Problem- General model of A.P.(A.P. as a special case of a T.P.) Hungarian Method of solving a A.P., variations in a A.P.- maximization, prohibited assignments. 3 2. Sequencing Problem : Methods of sequencing, Johnson’s Algorithm for a two machine problem, three machine problem and M-machine problem, Processing Two jobs through M- machines
BSMAT.docx