Two-machine flowshop scheduling with consecutive availability constraints

Edwin Tai Chiu Cheng, Guoqing Wang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

31 Citations (Scopus)

Abstract

In this paper we study a special case of the two-machine flowshop problem with an availability constraint imposed on each machine. The two availability constraints are consecutive. We establish some basic properties for the semiresumable case, i.e. if a job cannot be finished before the next down period of a machine, then the job will be partially restarted when the machine becomes available again. We provide a heuristic for the problem and show that it has a worst-case error bound of 2/3 for the nonresumable case.
Original languageEnglish
Pages (from-to)49-54
Number of pages6
JournalInformation Processing Letters
Volume71
Issue number2
Publication statusPublished - 30 Jul 1999

Keywords

  • Algorithms
  • Flowshop scheduling
  • Worst-case analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this