Approximability of two-machine no-wait flowshop scheduling with availability constraints

Research output: Journal article publicationJournal articleAcademic researchpeer-review

34 Citations (Scopus)


The approximability of two-machine no-wait flowshop scheduling problem with availability constraints was discussed. The objective of the paper was to minimize the completion time of the last job. Polynomial time approximation scheme was considered for the problem when the unavailable interval was imposed on only one machine, or the unavailable intervals on the two machines overlapped.
Original languageEnglish
Pages (from-to)319-322
Number of pages4
JournalOperations Research Letters
Issue number4
Publication statusPublished - 1 Jul 2003


  • Approximation scheme
  • Scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modelling and Simulation

Cite this