At the end of this course, the students; 1) Gain an ability to apply knowledge of mathematics, science, and engineering 2) Gain an ability to identify, formulate, and solve engineering problems 3) Gain an ability to use the techniques, skills, and modern engineering tools necessary engineering practice. 4) Explain the project management and schedule the production in production systems making project type production
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
None
COURSE DEFINITION
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
1st Week
Project Management: PERT
2nd Week
Project Management: CPM
3rd Week
Integer Programming
4th Week
Integer Programming Models and Examples
5th Week
Branch and Bound Algorithm
6th Week
Nonlinear Models and Examples
7th Week
Convexity, Concavity and Quadratic Forms
8th Week
Midterm
9th Week
Analytic and Numerical Solutions to the Single Variable Nonlinear Model
10th Week
Nonlinear Models with Several Variables
11th Week
Multi-Stage Decision Models
12th Week
Dynamic Programming, Examples
13th Week
Decision Making under Risk and Uncertainty
14th Week
Decision Making with Multiple Objective
RECOMENDED 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.
