Home Production Management Trainer HomeOverviewTactical PlanningOperative PlanningMiscellaneousGerman Pages

Operations scheduling: algorithm of Johnson

The algorithm of Johnson is applied for the problem of sequencing of N jobs on two machines.

Upon completion of the algorithm a Gantt-chart is displayed.


j index ob jobs
i index of machines
Mi machine i
t(j,i) processing time of job j on machine i


  • n jobs
  • flow-shop with two machines
  • deterministic processing times
  • objective: makespan minimization


- Askin/Standridge (1993), Chapter 4

Copyright ©2006 POM Prof. Tempelmeier GmbH All rights reserved. | About Us | Contact | Impressum |