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

A tabu search algorithm for no-wait job shop scheduling problem

Author

Listed:
  • Ghafour Ahani
  • Mostafa Asyabani

Abstract

In this paper, we consider no-wait job shop scheduling problem with makespan objective. In the no-wait problem two consecutive operations in each job must be processed without any interruption. No-wait job shop problem is strongly NP-hard. Mascis and Pacciarelli proposed an algorithm for no-wait job shop problem that produces good quality solution for benchmark problems but it mostly failed in finding a feasible solution. Therefore, we introduce a new neighbourhood structure in our tabu search to resolve this problem.

Suggested Citation

  • Ghafour Ahani & Mostafa Asyabani, 2014. "A tabu search algorithm for no-wait job shop scheduling problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 19(2), pages 246-258.
    • Handle: RePEc:ids:ijores:v:19:y:2014:i:2:p:246-258
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=58954
    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. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    2. Ivan Kristianto Singgih & Onyu Yu & Byung-In Kim & Jeongin Koo & Seungdoe Lee, 2020. "Production scheduling problem in a factory of automobile component primer painting," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1483-1496, August.

    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:19:y:2014:i:2:p:246-258. 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.