An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Research output: Journal article publicationJournal articleAcademic researchpeer-review

13 Citations (Scopus)


This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.
Original languageEnglish
Pages (from-to)2894-2901
Number of pages8
JournalComputers and Operations Research
Issue number10
Publication statusPublished - 1 Oct 2007


  • Approximation scheme
  • Availability constraint
  • Flowshop scheduling

ASJC Scopus subject areas

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

Cite this