IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v24y1977i1p159-162.html
   My bibliography  Save this article

A convex property of an ordered flow shop sequencing problem

Author

Listed:
  • S. S. Panwalkar
  • A. W. Khan

Abstract

A flow shop sequencing problem with ordered processing time matrices is considered. A convex property for the makespan sequences of such problems is discussed. On the basis of this property an efficient optimizing algorithm is presented. Although the proof of optimality has not been developed, several hundred problems were solved optimally with this procedure.

Suggested Citation

  • S. S. Panwalkar & A. W. Khan, 1977. "A convex property of an ordered flow shop sequencing problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(1), pages 159-162, March.
    • Handle: RePEc:wly:navlog:v:24:y:1977:i:1:p:159-162
    DOI: 10.1002/nav.3800240113
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800240113
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800240113?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. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.

    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:wly:navlog:v:24:y:1977:i:1:p:159-162. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.