Mechanical Engineering
Course Details

KTO KARATAY UNIVERSITY
Faculty of Engineering
Programme of Mechanical Engineering
Course Details
Faculty of Engineering
Programme of Mechanical Engineering
Course Details

| Course Code | Course Name | Year | Period | Semester | T+A+L | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| MAK6313 | Operations Research II | 3 | Spring | 6 | 3+0+0 | 3 | 3 |
| Course Type | Elective |
| Course Cycle | Bachelor's (First Cycle) (TQF-HE: Level 6 / QF-EHEA: Level 1 / EQF-LLL: Level 6) |
| Course Language | Turkish |
| Methods and Techniques | - |
| Mode of Delivery | Face to Face |
| Prerequisites | - |
| Coordinator | Prof. Faruk ÜNSAÇAR |
| Instructor(s) | - |
| Instructor Assistant(s) | - |
Course Content
Integer Linear Programming and Algorithms; Network Models; Minimum Covering Tree Algorithm; Shortest Path Problem and Algorithms; Maximal Flow Algorithm; Minimum Cost Capacity Flow Problem and Algorithm; CPM-PERT; Deterministic Stock Models; Tail Theory and Tail Models
Objectives of the Course
The aim of this course is to teach theory and solution procedures of integer programming, network models, inventory models and well models of operations research and thus to provide scientific determination of management policies and activities.
Contribution of the Course to Field Teaching
| Basic Vocational Courses | |
| Specialization / Field Courses | |
| Support Courses | |
| Transferable Skills Courses | |
| Humanities, Communication and Management Skills Courses |
Weekly Detailed Course Contents
| Week | Topics |
|---|---|
| 1 | Introduction to Integer Linear Programming Illustrative Examples Integer Linear Programming Algorithms, Branch-Boundary Algorithm |
| 2 | Cutting Plane Algorithm |
| 3 | Network Models Scope of network applications Network definitions Minimal Spanning Tree (mininal propagation) Algorithm |
| 4 | Shortest Path Problem Examples of the shortest path applications Shortest Path Algorithms Maximum Flow Model Number of cuts Maximum Flow Algorithm |
| 5 | Minimum flow capacity flow problem Network Display Linear Programming formulation Simplex Algorithm for network with minimum cost capacity |
| 6 | CPM-PERT Network display Critical path method and critical path calculations Creating timeline |
| 7 | Explanation of Project Evaluation and Review Technique and Case Studies |
| 8 | Midterm |
| 9 | Introduction to Deterministic Inventory (stock) Models General Inventory Model Static Economic Order Quantity (ESM) Models Classic ESM Model |
| 10 | ESM Model in case of possession of goods Production Model production model in case of lack of goods |
| 11 | Price discount economical order quantity model |
| 12 | Dynamic Economic Order Quantity Models |
| 13 | Introduction to Queuing Theory and Queuing Systems Basic Components of Tail Models The Role of Exponential Distribution, Pure Birth and Death Models Generalized Poisson Tail Model |
| 14 | Custom Poisson Tail Models Stability Status Performance Criteria Single Channel Tails |
| 15 | Multichannel Tails Machine Service Model Other Queue Models and Queue Decision Models |
| 16 | Final Sınavı |
Textbook or Material
| Resources | H.A.Taha, Operations Research: An Introduction, The MacMillan Company, NewYork, 7. baskı, 2003 |
Evaluation Method and Passing Criteria
| In-Term Studies | Quantity | Percentage |
|---|---|---|
| Attendance | - | - |
| Laboratory | - | - |
| Practice | - | - |
| Field Study | - | - |
| Course Specific Internship (If Any) | - | - |
| Homework | - | - |
| Presentation | - | - |
| Projects | - | - |
| Seminar | - | - |
| Quiz | - | - |
| Listening | - | - |
| Midterms | - | - |
| Final Exam | - | - |
| Total | 0 (%) | |
ECTS / Working Load Table
| Quantity | Duration | Total Work Load | |
|---|---|---|---|
| Course Week Number and Time | 0 | 0 | 0 |
| Out-of-Class Study Time (Pre-study, Library, Reinforcement) | 0 | 0 | 0 |
| Midterms | 0 | 0 | 0 |
| Quiz | 0 | 0 | 0 |
| Homework | 0 | 0 | 0 |
| Practice | 0 | 0 | 0 |
| Laboratory | 0 | 0 | 0 |
| Project | 0 | 0 | 0 |
| Workshop | 0 | 0 | 0 |
| Presentation/Seminar Preparation | 0 | 0 | 0 |
| Fieldwork | 0 | 0 | 0 |
| Final Exam | 0 | 0 | 0 |
| Other | 0 | 0 | 0 |
| Total Work Load: | 0 | ||
| Total Work Load / 30 | 0 | ||
| Course ECTS Credits: | 0 | ||
