IDEAS home Printed from
   My bibliography  Save this article

The scheduling problem where multiple machines compete for a common local buffer


  • Khosla, Inder


No abstract is available for this item.

Suggested Citation

  • Khosla, Inder, 1995. "The scheduling problem where multiple machines compete for a common local buffer," European Journal of Operational Research, Elsevier, vol. 84(2), pages 330-342, July.
  • Handle: RePEc:eee:ejores:v:84:y:1995:i:2:p:330-342

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

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

    References listed on IDEAS

    1. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    2. Sujit K. Dutta & Andrew A. Cunningham, 1975. "Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage," Management Science, INFORMS, vol. 21(9), pages 989-996, May.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. repec:pal:jorsoc:v:57:y:2006:i:3:d:10.1057_palgrave.jors.2602033 is not listed on IDEAS
    2. Belaid, R. & T’kindt, V. & Esswein, C., 2012. "Scheduling batches in flowshop with limited buffers in the shampoo industry," European Journal of Operational Research, Elsevier, vol. 223(2), pages 560-572.

    More about this item


    Access and download statistics


    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:eee:ejores:v:84:y:1995:i:2:p:330-342. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.