IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v6y2014i6p752-774.html
   My bibliography  Save this article

Variable neighbourhood search algorithms applied to job-shop scheduling problems

Author

Listed:
  • Pisut Pongchairerks

Abstract

This research attempts to find the neighbourhood structures of the variable neighbourhood search (VNS) algorithm well fitting to job-shop scheduling problem (JSP). So as to achieve this objective, this research adapts the seven neighbourhood structures given by the travelling salesman problem's literature to create the seven VNS algorithms for JSP. The performances of these proposed VNS algorithms are then compared to the performances of several existing algorithms, i.e., ACO, PSO and VNS algorithms taken from previously published literature. The comparison indicates that all proposed VNS algorithms perform better than the ACO and PSO algorithms with the significance level of 0.05. This paper finally reveals the neighbourhood structures performing well to JSP.

Suggested Citation

  • Pisut Pongchairerks, 2014. "Variable neighbourhood search algorithms applied to job-shop scheduling problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 6(6), pages 752-774.
    • Handle: RePEc:ids:ijmore:v:6:y:2014:i:6:p:752-774
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65421
    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.

    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:ijmore:v:6:y:2014:i:6:p:752-774. 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=320 .

    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.