Minimizing the number of early jobs on a proportionate flowshop

Baruch Mor*, Gur Mosheiov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

A proportionate flowshop is a special case of the classical flowshop, where the job processing times are machine-independent. We study the problem of minimizing the number of early jobs in this machine setting. This objective function has hardly been investigated on a single machine, and never on a flowshop. We introduce an efficient iterative solution algorithm. In each iteration, a single job is moved to the first position (and is added to the set of early jobs), and the remaining jobs are rescheduled such that the maximum earliness is minimized. The algorithm guarantees an optimal solution in O(n 3) time, where n is the number of jobs.

Original languageAmerican English
Pages (from-to)1426-1429
Number of pages4
JournalJournal of the Operational Research Society
Volume66
Issue number9
DOIs
StatePublished - 1 Sep 2015

Bibliographical note

Publisher Copyright:
© 2015 Operational Research Society Ltd.

Keywords

  • number of early jobs
  • proportionate flowshop
  • scheduling

Fingerprint

Dive into the research topics of 'Minimizing the number of early jobs on a proportionate flowshop'. Together they form a unique fingerprint.

Cite this