IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v72y1994i1p125-134.html
   My bibliography  Save this article

A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem

Author

Listed:
  • Brasel, H.
  • Kluge, D.
  • Werner, F.

Abstract

No abstract is available for this item.

Suggested Citation

  • Brasel, H. & Kluge, D. & Werner, F., 1994. "A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem," European Journal of Operational Research, Elsevier, vol. 72(1), pages 125-134, January.
    • Handle: RePEc:eee:ejores:v:72:y:1994:i:1:p:125-134
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)90335-2
    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.

    Citations

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


    Cited by:

    1. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    2. de Werra, D., 1996. "Extensions of coloring models for scheduling purposes," European Journal of Operational Research, Elsevier, vol. 92(3), pages 474-492, August.
    3. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, 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:eee:ejores:v:72:y:1994:i:1:p:125-134. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.