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

The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan

Author

Listed:
  • Munier-Kordon, Alix
  • Rebaine, Djamal

Abstract

This paper addresses the problem of scheduling unit-time operations with integral and non-negative time delay considerations on a two-machine open-shop environment. The criterion to minimize is the makespan. Two well solvable cases and two approximation algorithms, with their worst-case analyses, are presented.

Suggested Citation

  • Munier-Kordon, Alix & Rebaine, Djamal, 2010. "The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 203(1), pages 42-49, May.
    • Handle: RePEc:eee:ejores:v:203:y:2010:i:1:p:42-49
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(09)00516-5
    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

    as
    1. D Rebaine & V A Strusevich, 1999. "Two-machine open shop scheduling with special transportation times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(7), pages 756-764, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Courtad, Brenda & Baker, Kenneth & Magazine, Michael & Polak, George, 2017. "Minimizing flowtime for paired tasks," European Journal of Operational Research, Elsevier, vol. 259(3), pages 818-828.
    2. 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.
    3. Shahaboddin Shamshirband & Mohammad Shojafar & A. Hosseinabadi & Maryam Kardgar & M. Nasir & Rodina Ahmad, 2015. "OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises," Annals of Operations Research, Springer, vol. 229(1), pages 743-758, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    2. Zhang, Xiandong & van de Velde, Steef, 2010. "On-line two-machine open shop scheduling with time lags," European Journal of Operational Research, Elsevier, vol. 204(1), pages 14-19, July.
    3. Haiyan Wang & Chung‐Yee Lee, 2005. "Production and transport logistics scheduling with two transport mode choices," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 796-809, December.
    4. Wiesław Kubiak, 2023. "On the complexity of open shop scheduling with time lags," Journal of Scheduling, Springer, vol. 26(3), pages 331-334, June.
    5. Averbakh, Igor & Berman, Oded & Chernykh, Ilya, 2005. "A -approximation algorithm for the two-machine routing open-shop problem on a two-node network," European Journal of Operational Research, Elsevier, vol. 166(1), pages 3-24, October.
    6. 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.

    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:203:y:2010:i:1:p:42-49. 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.

    If CitEc recognized a bibliographic 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.

    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.