IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v42y2011i7p1143-1153.html
   My bibliography  Save this article

Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan

Author

Listed:
  • Danyu Bai
  • Lixin Tang

Abstract

This article addresses the open shop scheduling problem with the objective to minimise the maximum completion time, or makespan. Both asymptotical analysis and worst case analysis are conducted for the heuristic, rotation schedule (RS) algorithm. In the asymptotical analysis, we prove that the RS algorithm is asymptotically equal to the optimal solution when the problem size is large enough. In the worst case analysis, we show that the tight worst case performance ratio of RS algorithm is equal to the machine number m. To accelerate the convergence of the RS algorithm for medium size problems, the improved version of the heuristic, the modified RS (MRS) algorithm is presented. At the end of this article, the asymptotical optimality of the RS algorithm and the practical effectiveness of the MRS algorithm are shown by numerical simulations.

Suggested Citation

  • Danyu Bai & Lixin Tang, 2011. "Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan," International Journal of Systems Science, Taylor & Francis Journals, vol. 42(7), pages 1143-1153.
    • Handle: RePEc:taf:tsysxx:v:42:y:2011:i:7:p:1143-1153
    DOI: 10.1080/00207720903308397
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207720903308397
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207720903308397?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
    ---><---

    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.

    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:taf:tsysxx:v:42:y:2011:i:7:p:1143-1153. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.