| Course Type | Elective Course |
|---|
| Course Level | Bachelor's Degree |
|---|
| Year of Study | - |
|---|
| Semester | - |
|---|
| ECTS | 5 |
|---|
| Name of Lecturer(s) |
|
| Learning Outcomes |
At the end of this course, the students;
- Have the ability to apply knowledge of mathematics, science, and engineering
- Have the ability to identify, formulate, and solve engineering problems
- Have the ability to use the techniques, skills, and modern engineering tools necessary engineering practice.
- Learns the operational level decisions
- Learns the scheduling problems and their solution methods, able to make operational level scheduling decisions
|
| Mode of Delivery | Face to face |
|---|
| Prerequisites | No |
|---|
| Recommended Optional Programme Components | None |
|---|
| Course Description | In 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 |
| WEEK |
TOPICS |
|
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 |
|
| Recommended or Required Reading | Pinedo Michael, (2002) Scheduling: Theory, Algorithms, and Systems; Prentice Hall |
|---|
| Planned Learning Activities and Teaching Methods |
- Lecture
- Questions/Answers
- Problem Solving
- Practice
- Presentation
|
|---|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
30 |
| Assignment |
1 |
15 |
| Quiz |
1 |
10 |
| Attendance |
1 |
5 |
| 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 |
1 |
4 |
4 |
| Individual or group work |
14 |
2 |
28 |
| Preparation for Final exam |
1 |
25 |
25 |
| Course hours |
14 |
3 |
42 |
| Preparation for Midterm exam |
1 |
25 |
25 |
| Laboratory (including preparation) |
|
|
|
| Final exam |
1 |
2 |
2 |
| Homework |
1 |
8 |
8 |
| Total Work Load | 136 |
| Total Work Load / 30 (h) | 4.53 |
| ECTS Credit of the Course | 5 |
|
| Language of Instruction | Turkish |
|---|
| Work Placement(s) | No |
|---|
