IL4012 Scheduling Algorithms Syllabus:

IL4012 Scheduling Algorithms Syllabus – Anna University PG Syllabus Regulation 2021

OBJECTIVES:

 Introduce the basic concepts of scheduling theory.
 Understand the application of single machine scheduling algorithms.
 Perceive knowledge in parallel machine scheduling algorithms.
 Grasp the concept of flow shop scheduling and its algorithm.
 Familiarize the students in the use of algorithms for job scheduling problems

UNIT I SCHEDULING THEORY

Scheduling background – Scheduling function – Sequencing – Ready time – Flow time – Tardiness – Weighted flow time – Inventory – Regular measures of performance – Dominant schedules – SPT, EDD, WSPT sequences – Scheduling Theorems.

UNIT II SINGLE MACHINE SCHEDULING

Pure sequencing model – Hodgson’s algorithm – Smith’s rule – Wilkerson Irwin algorithm – Neighborhood search – Dynamic programming technique – Branch and Bound algorithm – Non simultaneous arrivals – Minimizing T and F for dependent jobs – Sequence dependent set up times.

UNIT III PARALLEL MACHINE SCHEDULING

Preemptive jobs: McNaughton’s algorithm – Non preemptive jobs – Heuristic procedures – Minimizing Fw : H1 &Hm heuristics – Dependent jobs: Hu’s algorithm – Muntz Coffman algorithm.

UNIT IV FLOW SHOP SCHEDULING

Characteristics – Johnson’s algorithm – Extension of Johnson’s rule – Campbell Dudek Smith algorithm – Palmer’s method – Start lag, stop lag – Mitten’s algorithm – Ignall Schrage algorithm – Despatch index heuristic.

UNIT V JOB SHOP SCHEDULING

Characteristics –Graphical tools – Jackson’s algorithm – Feasible, Semi-active and Active schedules – Single pass approach – Non delay schedule – Priority dispatching rules – Heuristic schedule generation – Open shop scheduling.

TOTAL: 45 PERIODS

OUTCOMES:

CO1: Understand the basics of Scheduling theory.
CO2: Understand various single machine scheduling algorithms.
CO3: Understand various parallel machine scheduling algorithms.
CO4: Understand various flow shop scheduling algorithms.
CO5: Understand various job shop scheduling algorithms

REFERENCES:

1. Kenneth R.Baker, “Introduction to sequencing and scheduling”, John Wiley & Sons, New York 2000.
2. Richard W. Conway, William L.Maxwell and Louis W. Miller,“Theory of Scheduling”, Dover Publications, 2003.