IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v27y1979i4p782-791.html
   My bibliography  Save this article

The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

Author

Listed:
  • Jeffrey B. Sidney

    (University of Ottawa, Ottawa, Ontario)

Abstract

The n -job 2-machine flow shop problem with series-parallel precedence constraints is considered with the objective to minimize makespan. Recent results of Kurisu are utilized in the development of a polynomial bounded optimal algorithm.

Suggested Citation

  • Jeffrey B. Sidney, 1979. "The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations," Operations Research, INFORMS, vol. 27(4), pages 782-791, August.
    • Handle: RePEc:inm:oropre:v:27:y:1979:i:4:p:782-791
    DOI: 10.1287/opre.27.4.782
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.4.782
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.27.4.782?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Chung-Yee Lee & Ming Liu & Chengbin Chu, 2015. "Optimal Algorithm for the General Quay Crane Double-Cycling Problem," Transportation Science, INFORMS, vol. 49(4), pages 957-967, November.
    2. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.

    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:inm:oropre:v:27:y:1979:i:4:p:782-791. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.