Two-machine flowshop scheduling with conditional deteriorating second operations

Bertrand M.T. Lin*, T. C.E. Cheng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


This paper considers a flowshop-scheduling problem with a waiting time constraint imposed to restrict the processing of the two operations of each job. If the second operation of a job cannot start within a specified waiting time after the completion of its first operation, then an extra processing time will be incurred for its second operation as a penalty. We first show that even a greatly restricted version of the problem is strongly N P-hard. We then develop an O(n2) algorithm to determine the makespan of a processing sequence of the jobs.

Original languageEnglish
Pages (from-to)91-98
Number of pages8
JournalInternational Transactions in Operational Research
Issue number2
StatePublished - 1 Jan 2006


  • Flowshop scheduling
  • Makespan
  • N P-hardness
  • Waiting time

Fingerprint Dive into the research topics of 'Two-machine flowshop scheduling with conditional deteriorating second operations'. Together they form a unique fingerprint.

Cite this