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) learn the operational level decisions 5) learn the scheduling problems and their solution methods and gain an ability to make operational level scheduling decisions
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
None
COURSE DEFINITION
General-purpose scheduling procedures, time complexities, heuristic methods, deterministic scheduling problems with single-machine, parallel machine and serial work-flow, dynamic scheduling problems and identification of priorities, the overview of other scheduling problems, applications in production systems.
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
Midterm
9th Week
Scheduling Criteria For Different Systems
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 READING
1. Pinedo Michael, (2002) Scheduling: Theory, Algorithms, and Systems; Prentice Hall