Exact algorithms for single-machine scheduling problems with a variable maintenance

Kuo Ching Ying, Chung-Cheng Lu*, Jhao Cheng Chen

*Corresponding author for this work

Research output: Contribution to journalArticle

21 Scopus citations

Abstract

This paper deals with four single-machine scheduling problems (SMSPs) with a variable machine maintenance. The objectives of the four SMSPs are to minimize mean lateness, maximum tardiness, total flow time and mean tardiness, respectively. These four SMSPs are important in the literature and in practice. This study proposes an exact algorithm with the computational complexity O(n2) for each of the four SMSPs. In addition to the given jobs, the machine maintenance activity between two consecutive jobs is optimally scheduled.

Original languageEnglish
Pages (from-to)427-433
Number of pages7
JournalComputers and Industrial Engineering
Volume98
DOIs
StatePublished - 1 Aug 2016

Keywords

  • Exact algorithms
  • Scheduling
  • Variable maintenance

Fingerprint Dive into the research topics of 'Exact algorithms for single-machine scheduling problems with a variable maintenance'. Together they form a unique fingerprint.

  • Cite this