3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints

Research output: Journal article publicationJournal articleAcademic researchpeer-review

16 Citations (Scopus)


We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present 3/2-approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results.
Original languageEnglish
Pages (from-to)161-165
Number of pages5
JournalInformation Processing Letters
Issue number4
Publication statusPublished - 30 Nov 2003


  • Approximation algorithms
  • Scheduling

ASJC Scopus subject areas

  • Computational Theory and Mathematics


Dive into the research topics of '3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints'. Together they form a unique fingerprint.

Cite this