|
|
| END4020 | Operation Research-III | 3+0+0 | ECTS:5 | | Year / Semester | Spring Semester | | Level of Course | First Cycle | | Status | Elective | | Department | DEPARTMENT of INDUSTRIAL ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | Face to face | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Dr. Öğr. Üyesi Gül İMAMOĞLU | | Co-Lecturer | NA | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | To gain the ability to analytically analyze the problems in different structures in production or service systems. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | Students should be able to collect, process and model the data for solving industrial engineering problems. Also they should be able to make experiment on this data and analyze the results. | 2 | | | LO - 2 : | Students should be able to define, analyze, model and solve the industrial engineering problems. | 2 | | | LO - 3 : | The Student should be able to use the techniques, skills and modern tools which are necessary for industrial engineering applications. | 2 | | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| In this course, goal programming, game theory, dynamic programming, markov processes and queuinig models that have analytical solution will be examined. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Goal Programming: Non-Preemptive and Preemptive Goal Programming, Modeling, Solution Approaches | | | Week 2 | Goal Programming: Non-Preemptive and Preemptive Goal Programming, Modeling, Solution Approaches | | | Week 3 | GAMS Applications | | | Week 4 | Game Theory: Game concept and its application fields, Two-Person games, n-Person games | | | Week 5 | Game Theory: Two-Person Zero-Sum Games, Two-Person Constant-Sum Games, Two-Person NonConstant-Sum Games, | | | Week 6 | GAMS Applications | | | Week 7 | Dynamic Programming: Fundamentals of Dynamic Programming, Mathematical Formulations and Calculating Methods | | | Week 8 | Dynamic Programming: Shortest Path Problems, Knapsack Problems | | | Week 9 | Midterm Sınavı | | | Week 10 | Dynamic Programming: Purchasing Problems in Manufacturing Systems | | | Week 11 | Introduction to Stochastic Processes: Markov Chains, n-Step Transition Probabilities | | | Week 12 | Introduction to Stochastic Processes: Classification of States in a Markov Chain, Steady-State Probabilities, Mean First Passage Times, Absorbing Chains | | | Week 13 | Queuinig Models that have Analytical Solution : M/M/1 ve M/M/S Queuinig Systems | | | Week 14 | Queuinig Models that have Analytical Solution : M/M/1 ve M/M/S Queuinig Systems | | | Week 15 | Applications | | | Week 16 | Final Exam | | | |
| 1 | Winston, W.L., (1993), An Introduction to Operational Research | | | |
| 1 | Taha, H.,(2003), An Introduction to Operations Research, 7th Ed., Prentice Hall. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | 6/4/2019 | 2 | 50 | | End-of-term exam | 16 | 20/5/2019 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 11 | 33 | | Sınıf dışı çalışma | 2 | 14 | 28 | | Arasınav için hazırlık | 5 | 1 | 5 | | Arasınav | 2 | 1 | 2 | | Uygulama | 3 | 3 | 9 | | Ödev | 1 | 4 | 4 | | Dönem sonu sınavı için hazırlık | 5 | 1 | 5 | | Dönem sonu sınavı | 2 | 1 | 2 | | Total work load | | | 88 |
|