Improved heuristic for two-machine flowshop scheduling with an availability constraint

Edwin Tai Chiu Cheng, Guoqing Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

69 Citations (Scopus)


In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 1/2 of the heuristic provided by Lee is tight. We then develop an improved heuristic with a worst-case error bound of 1/3.
Original languageEnglish
Pages (from-to)223-229
Number of pages7
JournalOperations Research Letters
Issue number5
Publication statusPublished - 1 Jan 2000

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this