Regular scheduling measures on proportionate flowshop with job rejection

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

In this article, we study the method of job rejection in the setting of proportionate flowshop, and focus on minimizing regular performance measures, subject to the constraint that the total rejection cost cannot exceed a given upper bound. In particular, we study total completion time, maximum tardiness, total tardiness, and total weighted number of tardy jobs. All the addressed problems are NP-hard as their single machine counterpart are known to be NP-hard. To the best of our knowledge, there are no detailed solutions in scheduling literature to the first two problems, whereas the last two problems were never addressed to date. For each problem, we provide a pseudo-polynomial dynamic programming solution algorithm, and furthermore, we enhance the reported running time of the first two problems. Our extensive numerical study validates the efficiency of the provided solutions.

Original languageEnglish
Article number107
JournalComputational and Applied Mathematics
Volume39
Issue number2
DOIs
StatePublished - 1 May 2020

Keywords

  • Dynamic programming
  • Job rejection
  • Proportionate flowshop
  • Regular performance measures
  • Scheduling

Fingerprint

Dive into the research topics of 'Regular scheduling measures on proportionate flowshop with job rejection'. Together they form a unique fingerprint.

Cite this