Skip to main content

END 428 - Scheduling

Faculty of Engineering and Natural Sciences · Industrial Engineering (English 30%) · Undergraduate

ECTS: 5 T+P+L: 3+0+0 Departmental Elective
Coordinator: Arş. Gör. Biset TOPRAK

Course Objective

It is aimed that students learn to rank the works given in a production system in accordance with the criteria chosen according to the constraints, features and capacities of the machines.

Course Content

Single machine production systems, parallel machines, shop floor production, open shop type production, mass production. Dependent scheduling at setup and setup time. Intuitive techniques used in scheduling and optimization: G-Wright, scheduling on single machines, scheduling on multiple machines.

Course Learning Outcomes

  1. The student has the knowledge of executing iterative algorithms.
  2. The student can develop methodological approaches in planning the system.
  3. The student can evaluate the system as a whole.
  4. Students will have the ability to sort the works in the most efficient way.
  5. The student gains the ability to choose the most appropriate methods in scheduling the system.

Core Area Distribution

(52) Engineering and Engineering Trades%60 (54) Manufacturing and Processing%40

Teaching Methods

ExpressionQuestion-AnswerSelf studyProblem SolvingProject Based Learning (Including Field Work)

Assessment & Evaluation

Project / DesignTesting (Essay / Tests: True-Falls, multiple-choice, short answer, matching)

ECTS / Workload

ActivityQuantityDuration (h)Total Workload
Course Duration (Including Exam Week)16348
Out of Class Study Period16232
Midterm11515
Quiz000
Assignment000
Practice12020
Final000

Course Schedule

WeekSubjectPreparation
1Course Plan, Evaluation Criteria, Resources to Use, Introduction to SchedulingCourse Plan, Evaluation Criteria, Resources to Use, Introduction to Scheduling
2Notation, Gantt Chart, Performance Measures, Single Machine Scheduling, Priority Rules (FCFS, SPT, LPT, EDD) ​Notation, Gantt Chart, Performance Measures, Single Machine Scheduling, Priority Rules (FCFS, SPT, LPT, EDD) ​
3Single Machine Scheduling (continued), Critical Ratio, WSPT, Moore's Algorithm, Priority Constraints (Lawler's Algorithm), Leading State ​Single Machine Scheduling (continued), Critical Ratio, WSPT, Moore's Algorithm, Priority Constraints (Lawler's Algorithm), Leading State ​
4Parallel Machine SchedulingParallel Machine Scheduling
5Priority Constrained Parallel Machine SchedulingPriority Constrained Parallel Machine Scheduling
6Scheduling of Parallel Machines at Different Speeds (Leave-Ahead Situation)Scheduling of Parallel Machines at Different Speeds (Leave-Ahead Situation)
7midterm exammidterm exam
8Solving Exam QuestionsSolving Exam Questions
9Scheduling in Flow Type Shops (Johnson Algorithm, Palmer Heuristic) ​Scheduling in Flow Type Shops (Johnson Algorithm, Palmer Heuristic) ​
10Scheduling in Flow Type Shops (Johnson Algorithm, Palmer Heuristic) ​Scheduling in Flow Type Shops (Johnson Algorithm, Palmer Heuristic) ​
11Shop Style Scheduling & Shifting Bottleneck IntuitiveShop Style Scheduling & Shifting Bottleneck Intuitive
12LEKIN Applications & Project ​LEKIN Applications & Project ​
13Mathematical Modeling & ProjectMathematical Modeling & Project
14Mathematical Modeling & ProjectMathematical Modeling & Project
15Project PresentationsProject Presentations
16Project PresentationsProject Presentations