On Two-machine Flow Shop Scheduling

Lin Chen, Wen Chang Luo, Guo Chuan Zhang

Research output: Contribution to journalArticlepeer-review


In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.

Original languageEnglish
Pages (from-to)333-339
Number of pages7
JournalJournal of the Operations Research Society of China
Issue number3
StatePublished - Sep 1 2014


  • Flow shop
  • Linear time
  • Online algorithm

Fingerprint Dive into the research topics of 'On Two-machine Flow Shop Scheduling'. Together they form a unique fingerprint.

Cite this