Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

Alessandro Agnetis, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.

Original languageAmerican English
Pages (from-to)885-892
Number of pages8
JournalOptimization Letters
Volume11
Issue number4
DOIs
StatePublished - 1 Apr 2017

Bibliographical note

Publisher Copyright:
© 2016, Springer-Verlag Berlin Heidelberg.

Keywords

  • Flowshop
  • Job rejection
  • Makespan
  • Position-dependent processing times
  • Scheduling

Fingerprint

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

Cite this