Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

Shir Fiszman, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

Abstract

We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n4) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n5) time.

Original languageAmerican English
Pages (from-to)39-43
Number of pages5
JournalInformation Processing Letters
Volume132
DOIs
StatePublished - Apr 2018

Bibliographical note

Publisher Copyright:
© 2017

Keywords

  • Job-rejection
  • Position-dependent processing times
  • Proportionate flowshop
  • Scheduling
  • Total load

Fingerprint

Dive into the research topics of 'Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection'. Together they form a unique fingerprint.

Cite this