Home  »  Faculty of Engineering »  Program of Industrial Engineering (English 30%)

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
SCHEDULING END444 - 3 + 0 5

TYPE OF COURSE UNITElective Course
LEVEL OF COURSE UNITBachelor's Degree
YEAR OF STUDY-
SEMESTER-
NUMBER OF ECTS CREDITS ALLOCATED5
NAME OF LECTURER(S)Assistant Professor Tusan Derya
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Have the ability to apply knowledge of mathematics, science, and engineering
2) Have the ability to identify, formulate, and solve engineering problems
3) Have the ability to use the techniques, skills, and modern engineering tools necessary engineering practice.
4) Learns the operational level decisions
5) Learns the scheduling problems and their solution methods, able to make operational level scheduling decisions
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENTNone
COURSE DEFINITIONIn this course, scheduling and sequencing (scheduling theory) problems and basic formulations for these problems are covered. General solution approaches for scheduling problems in systems with single machine, paralel machine and multiple machines are examined. Optimisation and heuristic methods used for these problems are discussed. Relations between vehicle routing and scheduling problems and problems having penalty functions for early and tardy jobs are included as special scheduling problems.
COURSE CONTENTS
WEEKTOPICS
1st Week Basics of Scheduling Problems
2nd Week Common Scheduling Problems
3rd Week Single Machine Scheduling
4th Week Scheduling in Parallel Machines
5th Week Multiple Machine Scheduling
6th Week Flow Shop and Job Shop Scheduling
7th Week Permutation Scheduling
8th Week Scheduling Criteria For Different Systems
9th Week Midterm
10th Week Static and Dynamic Scheduling Rules
11th Week Solution Methods for Scheduling Problems
12th Week Mathematical Models For Scheduling Problems
13th Week Exact Solution Methods
14th Week Heuristic Algorithms
RECOMENDED OR REQUIRED READINGPinedo Michael, (2002) Scheduling: Theory, Algorithms, and Systems; Prentice Hall
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Questions/Answers,Problem Solving,Practice,Presentation
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Assignment115
Quiz110
Attendance15
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam122
Preparation for Quiz144
Individual or group work14228
Preparation for Final exam12525
Course hours14342
Preparation for Midterm exam12525
Laboratory (including preparation)
Final exam122
Homework188
Total Workload136
Total Workload / 304,53
ECTS Credits of the Course5
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4LO5
K1  X   X   X     X
K2  X   X   X     X
K3      X     X
K4    X   X   X   X
K5         
K6         
K7         
K8         
K9         
K10         
K11