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

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

Author

Listed:
  • Danyu Bai
  • Zhihai Zhang

Abstract

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

Suggested Citation

  • Danyu Bai & Zhihai Zhang, 2014. "On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(8), pages 1657-1667, August.
    • Handle: RePEc:taf:tsysxx:v:45:y:2014:i:8:p:1657-1667
    DOI: 10.1080/00207721.2012.748943
    as

    Download full text from publisher

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

    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:45:y:2014:i:8:p:1657-1667. 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.