IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v17y2013i3p275-294.html
   My bibliography  Save this article

Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop

Author

Listed:
  • Fariborz Jolai
  • Seyed Morteza Goldansaz
  • Amir Hossein Zahedi-Anaraki

Abstract

This paper presents an imperialist competitive algorithm (ICA) and a simulated annealing (SA) algorithm in a non-preemptive open shop scheduling problem with job dependent setup times and sequence dependent transportation times to minimise the makespan (total completion time). The parameters of the algorithms are tuned by the response surface methodology (RSM). Based on classic approach, the scheduling problems are classified into small, medium and large sized problems. To evaluate the performance of the proposed ICA, its results are compared with the optimum ones obtained by GAMS for the small sized instances. Moreover, for the medium to large sized instances, the obtained solutions by the ICA are compared with the solutions of the effective method - SA algorithm - and the results are analysed.

Suggested Citation

  • Fariborz Jolai & Seyed Morteza Goldansaz & Amir Hossein Zahedi-Anaraki, 2013. "Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 17(3), pages 275-294.
    • Handle: RePEc:ids:ijores:v:17:y:2013:i:3:p:275-294
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=54436
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Mejía, Gonzalo & Yuraszeck, Francisco, 2020. "A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times," European Journal of Operational Research, Elsevier, vol. 285(2), pages 484-496.

    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:ids:ijores:v:17:y:2013:i:3:p:275-294. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.