IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v83y1998i0p137-16010.1023-a1018903912673.html
   My bibliography  Save this article

Parallel branch-and-bound methods for thejob-shop scheduling problem

Author

Listed:
  • Michael Perregaard
  • Jens Clausen

Abstract

Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been branch-and-bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10machines and 10 jobs. In the current study, we focus on parallel methods for solving JSS problems. We implement two different parallel branch-and-bound algorithms for JSS on a16-processor MEIKO Computing Surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The parallel part of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Michael Perregaard & Jens Clausen, 1998. "Parallel branch-and-bound methods for thejob-shop scheduling problem," Annals of Operations Research, Springer, vol. 83(0), pages 137-160, October.
    • Handle: RePEc:spr:annopr:v:83:y:1998:i:0:p:137-160:10.1023/a:1018903912673
    DOI: 10.1023/A:1018903912673
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Reinhard Bürgy, 2017. "A neighborhood for complex job shop scheduling problems with regular objectives," Journal of Scheduling, Springer, vol. 20(4), pages 391-422, August.

    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:spr:annopr:v:83:y:1998:i:0:p:137-160:10.1023/a:1018903912673. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.