IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v42y1996i6p797-813.html
   My bibliography  Save this article

A Fast Taboo Search Algorithm for the Job Shop Problem

Author

Listed:
  • Eugeniusz Nowicki

    (Technical University of Wroc{\l}aw, Institute of Engineering Cybernetics, ul. Janiszewskiego 11/17, 50-372 Wroc{\l}aw, Poland)

  • Czeslaw Smutnicki

    (Technical University of Wroc{\l}aw, Institute of Engineering Cybernetics, ul. Janiszewskiego 11/17, 50-372 Wroc{\l}aw, Poland)

Abstract

A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in a job shop is presented. The algorithm is based on a taboo search technique with a specific neighborhood definition which employs a critical path and blocks of operations notions. Computational experiments (up to 2,000 operations) show that the algorithm not only finds shorter makespans than the best approximation approaches but also runs in shorter time. It solves the well-known 10 \times 10 hard benchmark problem within 30 seconds on a personal computer.

Suggested Citation

  • Eugeniusz Nowicki & Czeslaw Smutnicki, 1996. "A Fast Taboo Search Algorithm for the Job Shop Problem," Management Science, INFORMS, vol. 42(6), pages 797-813, June.
    • Handle: RePEc:inm:ormnsc:v:42:y:1996:i:6:p:797-813
    DOI: 10.1287/mnsc.42.6.797
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.42.6.797
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.42.6.797?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
    ---><---

    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:inm:ormnsc:v:42:y:1996:i:6:p:797-813. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.