BAYBURT University Information Package / Course Catalogue

Home Information on the Institution Information on Degree Programmes General Information for Students
Description of Individual Course Units
Course Unit CodeCourse Unit TitleType of Course UnitYear of StudySemesterNumber of ECTS Credits
EM303BOperations Research IICompulsory356
Level of Course Unit
First Cycle
Objectives of the Course
Department of Industrial Engineering Students Stochastic Processes, Queuing Systems, to recognize and promote the network Models, dynamic models of Inventory and the ability to apply.
Name of Lecturer(s)
Doç. Dr. Hamid YILMAZ
Learning Outcomes
1Stochastic processes and Markov chain so that you can define
2Creation of transition matrices of Markov chain, be expressed
3n-Case Possibilities: n Switch Time j Multistep Did to be able to explain with examples
4Calculate the number of steady-state Olasılıklarını the transition to stable and Deciding to be able to use
5Classification Of States Of The Markov Zincirlerindeki
6The average first-pass Number to find and Interpret
7Absorber (the absorber) Chains and knowing the properties of the Problems Solve and Interpret
8A variety of sample problems tail patterns identify and implement the solution
9Apply network models, CPM and PERT method use
10Know and apply dynamic programming to know and apply the inventory models
Mode of Delivery
Normal Education
Prerequisites and co-requisities
None
Recommended Optional Programme Components
None
Course Contents
Stochastic mathematical models, discrete-State, discrete-time stochastic process. Time-dependent Markov chains, analysis of steady-state Equilibrium States, intuitive interpretation. Average first step numbers. Absorber (the absorber) chains. Queuing theory. Network models, PERT, CPM. Dynamic programming. Inventory models
Weekly Detailed Course Contents
WeekTheoreticalPracticeLaboratory
1Markov Chains-definition, the transition matrix of Possibilities, are likely to post n periods
2Markov Chains-gambler's failure example, vases-top example
3Classification Of States, Stable, Steady-State Has Been Advised Of The Possibilities Of Intuitive Interpretation Of The Situation
4 Average Number Of First Transition, Absorbent-Absorbing Markov Chains
5Examples Of Markov Chain
6Queuing theory-1
7Queuing theory-2
8Midterm exam
9Queuing theory & practice
10Network models-1
11Network models-2 C P M
12Inventory models-1 Determinictic
13Network models-3 ' P E R T
14Inventory models-2 S t ocastic
15Inventory models-2 S t ocastic
Recommended or Required Reading
Operations research, and adapted by s. Aggarwal BARAY, Saha trades, 6. All in-house translation, İstanbul, Litaratür publishing, 2000 Operations Research: An introduction, Hamdy Taha, Ninth ed., Pearson, 2011. Introduction to Operations Research, Frederich s. Hillier, Gerald j. Lieberman, Ninth ed. McGraw-Hill, 2010 Operations Research, t. l. Winston, PWS Publishing Company, 1997. MATLAB and engineering applications, Krishna c., A.U., ALFA, 2003
Planned Learning Activities and Teaching Methods
Assessment Methods and Criteria
Term (or Year) Learning ActivitiesQuantityWeight
Midterm Examination1100
SUM100
End Of Term (or Year) Learning ActivitiesQuantityWeight
Final Examination1100
SUM100
Term (or Year) Learning Activities40
End Of Term (or Year) Learning Activities60
SUM100
Language of Instruction
Turkish
Work Placement(s)
None
Workload Calculation
ActivitiesNumberTime (hours)Total Work Load (hours)
Midterm Examination111
Final Examination122
Attending Lectures14342
Report Preparation11818
Self Study14342
Individual Study for Mid term Examination12020
Individual Study for Final Examination12525
Homework11616
TOTAL WORKLOAD (hours)166
Contribution of Learning Outcomes to Programme Outcomes
PO
1		PO
2		PO
3		PO
4		PO
5		PO
6		PO
7		PO
8
LO122232321
LO222332231
LO333233222
LO422222222
LO532322231
LO623322231
LO732332221
LO823232321
LO922223321
LO1033323221
* Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High