Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance

Baruch Mor*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

We study due-date assignment problems with common flow allowance on a proportionate flowshop. We focus on both minsum and minmax objectives. Both cases are extended to a setting of a due-window. The proposed solution procedures are shown to be significantly different from those of the single machine problems. All the problems studied here are solved in polynomial time: The minsum problems in O(n2) and the minmax problems in O(nlog n), where n is the number of jobs.

Original languageAmerican English
Pages (from-to)360-370
Number of pages11
JournalEuropean Journal of Operational Research
Volume254
Issue number2
DOIs
StatePublished - 16 Oct 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V. All rights reserved.

Keywords

  • Due-date assignment
  • Due-window assignment
  • Flow-allowance
  • Proportionate flowshop
  • Scheduling

Fingerprint

Dive into the research topics of 'Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance'. Together they form a unique fingerprint.

Cite this