A note: flowshop scheduling with linear deterioration and job-rejection

Baruch Mor, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

We study a scheduling problem on an m-machine flowshop with linear deterioration of job processing times and job rejection. The objectives are minimum makespan and minimum total load, subject to an upper bound on the total permitted rejection cost. The problems are NP-hard (since the single machine makespan minimization version was shown to be hard), and we introduce pseudo-polynomial dynamic programming algorithms, thus proving that both problems are NP-hard in the ordinary sense.

Original languageAmerican English
Pages (from-to)103-111
Number of pages9
Journal4OR
Volume19
Issue number1
DOIs
StatePublished - Mar 2021

Bibliographical note

Publisher Copyright:
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature.

Keywords

  • Dynamic programming
  • Flowshop
  • Job-rejection
  • Linear deterioration
  • Scheduling

Fingerprint

Dive into the research topics of 'A note: flowshop scheduling with linear deterioration and job-rejection'. Together they form a unique fingerprint.

Cite this