Single machine models - Scheduling function and theory – scheduling problem: objectives, constraints – pure sequencing – performance measures, sequencing theorems - SPT, EDD sequence – minimization of mean flow time, mean tardiness etc – branch and bound algorithm –assignment model.

Parallel machine models - Independent jobs Minimizing makespan.

Flow shop models - Johnson’s problem – Extension of Johnsons’s rule for 3 machine problem – Jackson’s method – algorithm – Palmer’s method.

Job shop models – dynamic job shop simulation.

Other models - Scheduling of intermittent production: Resource smoothing – Giffler Thomson algorithm – Branch and Bound method – Scheduling of continuous production - Line balancing.


  1. Michael Pinedoo, Scheduling: theory, algorithms and systems, Prentice Hall, New Delhi, 1995.

  2. King, J.R. Production planning and control, Pergamon International Library, 1975.

  3. Kenneth R.Baker, Introdution to sequencing and scheduling, John Wiley and Sons, 1974.