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

Two-Machine Open Shops with Renewable Resources

Author

Listed:
  • Bernd Jurisch

    (Memorial University of Newfoundland, St. John's, Newfoundland, Canada)

  • Wieslaw Kubiak

    (Memorial University of Newfoundland, St. John's, Newfoundland, Canada)

Abstract

In open shops with renewable resources, an operation may require additional resources, besides a machine, for its execution. All resources required by the operation are allocated to it all the time during its execution. At no time may total resource requirements exceed resource capacities. We consider the problem of minimizing makespan in a two-machine open shop with a single renewable resource. We show that optimal nonpreemptive schedules are not longer than optimal preemptive schedules, which we then translate into a polynomial time algorithm for the makespan minimization problem. This is an important generalization of a well-known result obtained by Gonzalez and Sahni (Gonzalez, G., S. Sahni. 1976. Open shop scheduling to minimize finish time. J. ACM 23 665–679.) for the two-machine open shop without additional resources. We also study the problem of minimizing makespan in a two-machine open shop with at least two different resources. In this case, optimal nonpreemptive schedules may be longer than optimal preemptive ones. We show that this makes the makespan minimization problem NP-hard.

Suggested Citation

  • Bernd Jurisch & Wieslaw Kubiak, 1997. "Two-Machine Open Shops with Renewable Resources," Operations Research, INFORMS, vol. 45(4), pages 544-552, August.
    • Handle: RePEc:inm:oropre:v:45:y:1997:i:4:p:544-552
    DOI: 10.1287/opre.45.4.544
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.45.4.544
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.45.4.544?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. 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. Ammar Oulamara & Djamal Rebaine & Mehdi Serairi, 2013. "Scheduling the two-machine open shop problem under resource constraints for setting the jobs," Annals of Operations Research, Springer, vol. 211(1), pages 333-356, December.

    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:45:y:1997:i:4:p:544-552. 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.