IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i9p1426-1429.html
   My bibliography  Save this article

Minimizing the number of early jobs on a proportionate flowshop

Author

Listed:
  • Baruch Mor

    (The Department of Economics and Business Administration, Ariel University, Ariel, Israel)

  • Gur Mosheiov

    (School of Business Administration, The Hebrew University, Jerusalem, Israel)

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(n3) time, where n is the number of jobs.

Suggested Citation

  • Baruch Mor & Gur Mosheiov, 2015. "Minimizing the number of early jobs on a proportionate flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(9), pages 1426-1429, September.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:9:p:1426-1429
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/pdf/jors2014112a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n9/full/jors2014112a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xinyu Sun & Xin-Na Geng & Tao Liu, 2020. "Due-window assignment scheduling in the proportionate flow shop setting," Annals of Operations Research, Springer, vol. 292(1), pages 113-131, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:66:y:2015:i:9:p:1426-1429. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.