Module designation

Operations Research (MAT212)

Semester(s) in which the module is taught

4th

Person responsible for the module

Dr. Herry Suprajitno

Language

Indonesian

Relation to curriculum

Compulsory / elective / specialisation

Teaching methods

Lecture, lesson, discussion, and presentation.

Workload (incl. contact hours, self-study hours)

2×170 minutes (2×50 minutes lecture and lesson, 2×60 minutes structural activities, 2×60 minutes self-study) per week for 16 weeks

Credit points

2 CP (3,2 ECTS)

Required and recommended prerequisites for joining the module

Linear Programming (MAT203)

Module objectives/intended learning outcomes

General Competence (Knowledge):

  Capable of implementing the concept of operatations research in right decision making.

Specific Competence: student are able to

1.      Explain definitions and models of Operations Research

2.      Make models and analyze the transportation problems

3.      Make models and analyze the Assignment Problems

4.      Make models and analyze Network Problems

5.      Make models and analyze PERT-CPM problems

6.      Make models and analyze Dynamic Programming problems

Content

Introduction to Operations Research, Transportation Problems, Assignment Problems, Network Analysis, PERT-CPM, Dynamic Programming.

Examination forms

Papers (Proposed Thesis Topics) and Presentation

Study and examination requirements

Students are considered to pass if they at least have got final score 40 (D).

Final score is calculated as follow: 10% softskill+20% assignment + 10% Quiz + 25% midterm + 35% final exam (Presentation).

 

Final index is defined as follow:

A

: 86 – 100

AB

: 78 – 85.99

B

: 70 – 77.99

BC

: 62 – 69.99

C

: 54 – 61.99

D

: 40 – 53.99

E

: 0 – 39.99

Reading list

1.       Hillier, F. S. and Lieberman, G. J., 2021, Introduction to Operations Research, Ed-11, McGraw-Hill, New York.

2.      Taha, A. H., 2017, Operations Research An Introduction, Pearson, England..

3.      Winston, W L, 1994, “ Operations Research, Applications and Algorithms “, Ed.3, Duxbury Press, California.