CIE342 Operations Scheduling Syllabus:

CIE342 Operations Scheduling Syllabus – Anna University Regulation 2021

COURSE OBJECTIVES:

• Define the basic concepts of scheduling theory.
• Illustrate the application of single machine scheduling algorithms.
• Transfer knowledge in parallel machine scheduling algorithms.
• Teach the concept of flow shop scheduling and its algorithm.
• Describe the use of algorithms for job shop scheduling algorithms.

UNIT I SCHEDULING THEORY

Scheduling background – Scheduling function – Sequencing – Measures of performance – Scheduling theorems – Pure sequencing model assumptions.

UNIT II SINGLE MACHINE SCHEDULING

Hogdson’s algorithm – Smith’s application – Wilkerson-Irwin algorithm – Neighborhood search technique – Dynamic programming approach – Branch and Bound algorithm – Non simultaneous arrivals – Dependent job problems – Sequence dependent set up times.

UNIT III PARALLEL MACHINE SCHEDULING

Preemptive jobs: McNaughton’s algorithm – Non pre-emptive jobs – Heuristic procedures – Minimizing weighted mean flow time: 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 -Gupta’s algorithm– Start lag, Sop 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- Meta heuristics in scheduling

TOTAL: 45 PERIODS
COURSE OUTCOMES:

CO1: Able to understand fundamental concepts of scheduling theory.
CO2: Students will be able to solve single machine sequencing problems with an objective to minimize mean flow time or mean tardiness.
CO3: Students will be able to design a parallel machine schedule which can minimize mean flow time, or makespan.
CO4: Students will be able to determine an optimal schedule for a flow shop.
CO5: Students will be able to solve complex job shop problems, design and evaluate various feasible job shop schedules.

TEXT BOOK:

1. Kenneth R.Baker, “Introduction to Sequencing and Scheduling”, John Wiley & Sons, New York, 2000.

REFERENCE:

1. Kenneth R.Baker, Dan Trietsch, “Principles of sequencing and scheduling”, John Wiley & Sons, New Yo