Skip to main content

END 301 - Operations Research II

Faculty of Engineering and Natural Sciences · Industrial Engineering (English 30%) · Undergraduate

ECTS: 6 T+P+L: 3+0+0 Compulsory
Coordinator: Dr. Öğr. Üyesi Ayşe Nuray CANAT
Instructors: Dr. Öğr. Üyesi Ayşe Nuray CANAT
Prerequisites: END 204 - Operations Research I

Course Objective

The teaching of the theory and solution procedures of Integer Programming, Goal Programming, Dynamic Programming, Inventory Models, and Queueing Models, thereby ensuring that management policies and activities are determined scientifically.

Course Content

Integer Linear Programming and Algorithms; Goal Programming, Dynamic Programming, Deterministic Stock Models; Queueing Theory and Queueing Models

Required Resources

1- Lecture Notes

2- Winston W.L. (2004) “Operations Research: Applications and Algorithms”, Brooks/Cole – Thomson Learning

Recommended Resources

1- Öztürk, Ahmet (2016) "Yöneylem Araştırması 16. Baskı", Ekin Basın Yayım ve Dağıtım

2- Taha H.A. (2003) "Operations Research: An Introduction", Pearson

3- Taha H.A. (2000) "Yoneylem Arastirmasi", Literatur Yayincilik (cev. Alp Baray and Sakir Esnaf)

4- Taylor B.W. III (2002) "Introduction to Management Science", Pearson.

Core Area Distribution

(46) Mathematics and Statistics%40 (48) Computing%10 (52) Engineering and Engineering Trades%50

Teaching Methods

ExpressionQuestion-AnswerExercise and PracticeGroup StudyCase StudyExperiment - Test / Lab/ Workshop / Field PracticeSelf studyProblem Solving

Assessment & Evaluation

HomeworkOral ExamProject / DesignTesting (Essay / Tests: True-Falls, multiple-choice, short answer, matching)

ECTS / Workload

ActivityQuantityDuration (h)Total Workload
Course Duration (Including Exam Week)16348
Out of Class Study Period16232
Midterm21224
Quiz000
Assignment188
Practice000
Final12626

Course Schedule

WeekSubjectPreparation
1Course Introduction, Integer Linear Programming ProblemsLecture Notes
2Integer Linear Programming ProblemsLecture Notes
3Integer Linear Programming Models and Solution Methods, Branch-and-Bound AlgorithmLecture Notes
4Integer Linear Programming Models and Solution Methods, Cutting Plane AlgorithmLecture Notes
5Formulation of goal programming modelsLecture Notes
6Solution of goal programming modelsLecture Notes
7Deterministic Dynamic ProgrammingLecture Notes
8Midterm Exam.
9Deterministic Dynamic Programming, Stochastic Dynamic ProgrammingLecture Notes
10Stochastic Dynamic ProgrammingLecture Notes
11Deterministic Inventory ModelsLecture Notes
12Deterministic Inventory Models, MIDTERM EXAMLecture Notes
13Introduction to Queueing Theory and Queueing Systems: Basic Components of Queueing Models, The Role of Exponential DistributionLecture Notes
14Pure Birth and Death Models; Generalized Poisson- Queuing ModelsLecture Notes
15Special Poisson Queueing Models; Steady-State Performance Measures, Single-Channel QueuesLecture Notes
16Final Exam.