Demonstrating Johnson’s algorithm via resource-constrained scheduling

T. C.E. Cheng, Miao-Tsong Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


The celebrated Johnson’s algorithm to solve the two-machine flowshop scheduling problem to minimise the makespan plays a prominent role in scheduling research. In using resource-constrained scheduling to interpret Johnson’s algorithm in teaching scheduling theory and operations management, we have received positive student feedback on the perceived intuition. We demonstrate this idea and show that the resource-constrained scheduling concept also helps simplify the proofs of some classical scheduling results.

Original languageEnglish
Pages (from-to)3326-3330
Number of pages5
JournalInternational Journal of Production Research
Issue number11
StatePublished - 3 Jun 2017


  • flowshop
  • makespan
  • relocation problem
  • resource constraint
  • scheduling

Fingerprint Dive into the research topics of 'Demonstrating Johnson’s algorithm via resource-constrained scheduling'. Together they form a unique fingerprint.

Cite this