Course code Course Name L-T-P -Credits Year of

Introduction
IE402 INDUSTRIAL SCHEDULING 3-0-0-3 2016
Prerequisite: Nil
Course Objectives
 To develop knowledge on the role of scheduling and techniques for minimizing
flow time.
 To understand scheduling methodologies for single machine and parallel machine
models.
 To acquire knowledge on advanced scheduling methodologies for flow shop and
job shop.
Syllabus:
Introduction -Single Machine Models - Problems without due dates -Problems with due date
General Purpose methodologies for single machine problems - Parallel Machine Models -Flow
Shop Scheduling - Job Shop Scheduling- Simulation studies of the Dynamic Job shop -
Introduction to Stochastic Single Machine and Parallel Machine Models- Case studies on
scheduling systems.
Expected outcome
After completing the course, the students will have:
i. Knowledge on the role of scheduling and techniques for minimizing flow time.
ii. Understanding on scheduling methodologies for single machine and parallel machine
models.
iii. Knowledge on advanced scheduling methodologies for flow shop and job shop.
Text Book:
1. Kenneth R. Baker , “Principles of Sequencing and Scheduling”, , John Wiley.
2. Michael L. Pinedo, “Scheduling – Theory, Algorithms and Systems”, , Springer.
References:
1. D.D.Bedworth and J.E.Bailey, “Integrated Production Control Systems”, Wiley.
2. E.G. Coffman, “Computer and Job shop Scheduling Theory”, Wiley.
3. Joseph Y-T. Leung, “Handbook of Scheduling-Algorithms, Models and Performance
Analysis”, Chapman & Hall/CRC Computer and Information Science series.
4. Peter Brucker , “Scheduling Algorithms”, Springer.
5. R.W.Conway, W.L.Maxwell and L.W.Miller, “Theory of Scheduling”, Addison
Wesley
6. S.French, “Sequencing and Scheduling”, , Elis Horwood Ltd., Chinchester,U.K.
Course Plan
Sem.
Module Contents Hours Exam
Marks
Introduction to scheduling:- Role of scheduling,
Terminologies involved in scheduling, Scheduling notations,
Graham et al scheduling problem representation, Classes of
Schedules, Regular and non-regular performance measures,
I 8 15%
Importance of regular performance measures and semi-active
schedule, Relationship between performance measures
(Theorems with proof).
Single Machine Models:- Basic two theorems for regular
 performance measure leading to permutation schedules (with
proof), Problems without due dates – Minimizing mean flow
time (SPT rule with proof), Minimizing weighted mean flow
time (WSPT rule with proof).
Problems with due date (Single Machine Models):- Lateness
criteria, Minimizing maximum lateness and tardiness (EDD
schedule rule with proof), Minimizing the number of Tardy
II 8 15%
jobs (Moore and Hodgson’s Algorithm), Minimizing Mean
Tardiness (Wilkerson-Irwin Algorithm), Single machine
problem with precedence constraint (Lawler’s algorithm).
FIRST INTERNAL EXAMINATION
General Purpose methodologies for single machine problems:-
Dynamic Programming approach, Branch & Bound Approach,
III Neighbourhood search techniques. Parallel Machine Models:- 8 15%
Parallel Identical processors and Independent jobs, Parallel
Identical processors and Dependent jobs.
Flow Shop Scheduling:- Permutation schedule, Johnson’s
Algorithm (with proof), Three machine problem, special cases
of m-machine problem solved by approximate Johnson’s
method, Branch & Bound Algorithms for Makespan problems.
IV 8 15%
Heuristic Approaches:- Palmer’s slope index heuristics,
Campbell, Dudek, and Smith (CDS) algorithm, Nawaz,
Enscore and Ham (NEH) algorithm. Ordered Flow shops, Flow
shops with blocking, No-wait Flow shops.
SECOND INTERNAL EXAMINATION
Job Shop Scheduling:- Types of schedules, Schedule
V generation, Branch & Bound Approach, Heuristic procedures, 5 20%
Integer Programming Approach.
Simulation studies of the Dynamic Job shop (Overview only)
VI Introduction to Stochastic Single Machine and Parallel 5 20%
Machine Models. Case studies on scheduling systems.
END SEMESTER EXAM

End Semester Examination Question Paper Pattern:

Examination duration: 3 hours Maximum Marks: 100
Part A (Modules I and II):
Candidates have to answer any 2 questions from a choice of 3 questions. Each full question
carries a total of 15 marks and can have a maximum of 4 sub questions (a, b, c, d). No two
questions shall be exclusively from a single module. All three questions shall preferably have
components from both modules. Marks for each question/sub question shall be clearly
specified. Total percentage of marks for the two modules put together as specified in the
curriculum shall be adhered to for all combinations of any two questions.
Part B (Modules III and IV):
(Same as for part A marks)
Part C (Modules V and VI):
(Same as for part A, except that each full question carries 20 marks)

Note: If use of tables and charts are permitted for the university examination for this course,
proper direction of the same should be provided on the facing sheet of the question paper.