Heuristics for two-machine flowshop scheduling with setup times and an availability constraint

Research output: Journal article publicationJournal articleAcademic researchpeer-review

18 Citations (Scopus)


This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than frac(2, 3).
Original languageEnglish
Pages (from-to)152-162
Number of pages11
JournalComputers and Operations Research
Issue number1
Publication statusPublished - 1 Jan 2007


  • Error bound
  • Flowshop scheduling
  • Heuristics

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this