NETWORK MODELS AND PROJECT MANAGEMENT

END508

Course Code: END508
Semester: -
Theory+Practice: 3 + 0
ECTS: 10

Course Type

Elective Course

Course Level

Master's Degree With Thesis

Year of Study

Semester

ECTS

Name of Lecturer(s)

Associate Professor Tusan Derya

Learning Outcomes

At the end of this course, the students;

Gain an ability to apply knowledge of mathematics, science, and engineering
Gain an ability to identify, formulate, and solve engineering problems
Gain an ability to use the techniques, skills, and modern engineering tools necessary engineering practice.
Explain the project management and schedule the production in production systems making project type production

Mode of Delivery

Face to face

Prerequisites

Recommended Optional Programme Components

None

Course Description

Basic concepts about networks. Shortest path, span and maximum flow problems. Management functions in project type manufacturing. Methods and phases of project planning. Project planning and control techniques (CPM, PERT etc.). Duration-cost analysis in project management and resource balancing problems.

Course Contents

WEEK	TOPICS
1^st Week	Project Management: PERT
2^nd Week	Project Management: CPM
3^rd Week	Integer Programming
4^th Week	Integer Programming Models and Examples
5^th Week	Branch and Bound Algorithm
6^th Week	Nonlinear Models and Examples
7^th Week	Convexity, Concavity and Quadratic Forms
8^th Week	Midterm
9^th Week	Analytic and Numerical Solutions to the Single Variable Nonlinear Model
10^th Week	Nonlinear Models with Several Variables
11^th Week	Multi-Stage Decision Models
12^th Week	Dynamic Programming, Examples
13^th Week	Decision Making under Risk and Uncertainty
14^th Week	Decision Making with Multiple Objective

Recommended or Required Reading

Dolan A., Aldous J., 1993, Networks and Algorithms, Wiley, 544 p.
Daskin M.S., 1995, Network and Discrete Location, Wiley, 498 p.
Rosen K.H., 1995, Discrete Mathematics and Its Application (3rd ed.), Mc Graw Hill, 710 p.
Lockyer K., Gordon J., 1991, Critical Path Analysis 5th ed., Pitman Publishing, 244 p.
Gray C.F., Larson E.W., 2000, Project Management, Mc Graw Hill, 496 p.
Chatfield C., Johnson T., 2003, Adım Adım Microsoft Project 2003, Arkadaş Yayınevi, 512 s.

Planned Learning Activities and Teaching Methods

Lecture
Questions/Answers
Problem Solving
Practice
Presentation

Assessment Methods and Criteria

	Quantity	Percentage (%)
Mid-term	1	30
Project	1	30
Total(%)		60
Contribution of In-term Studies to Overall Grade(%)		60
Contribution of Final Examination to Overall Grade(%)		40
Total(%)		100

ECTS Allocated Based on Student Workload

Activities	Quantity	Duration (Hour)	Total Workload (Hour)
Midterm exam	1	2	2
Preparation for Quiz
Individual or group work	14	14	196
Preparation for Final exam	1	25	25
Course hours	4	3	12
Preparation for Midterm exam	1	25	25
Laboratory (including preparation)
Final exam	1	2	2
Homework
Total Work Load			262
Total Work Load / 30 (h)			8.73
ECTS Credit of the Course			10

Language of Instruction

Turkish

Work Placement(s)

Programme Qualifications / Learning Outcomes

	LO1	LO2	LO3	LO4
K1	X	X	X	X
K2	X	X	X	X
K3			X	X
K4		X	X
K5				X
K6				X
K7
K8
K9				X
K10				X
K11