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

New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling

Author

Listed:
  • Robert H. Storer

    (Department of Industrial Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • S. David Wu

    (Department of Industrial Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Renzo Vaccari

    (Department of Industrial Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

Abstract

In this paper search heuristics are developed for generic sequencing problems with emphasis on job shop scheduling. The proposed methods integrate problem specific heuristics common to Operations Research and local search approaches from Artificial Intelligence in order to obtain desirable properties from both. The applicability of local search to a wide range of problems, and the incorporation of problem-specific information are both properties of the proposed algorithms. Two methods are proposed, both of which are based on novel definitions of solution spaces and of neighborhoods in these spaces. Applications of the proposed methodology are developed for job shop scheduling problems, and can be easily applied with any scheduling objective. To demonstrate effectiveness, the method is tested on the job shop scheduling problem with the minimum makespan objective. Encouraging results are obtained.

Suggested Citation

  • Robert H. Storer & S. David Wu & Renzo Vaccari, 1992. "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling," Management Science, INFORMS, vol. 38(10), pages 1495-1509, October.
    • Handle: RePEc:inm:ormnsc:v:38:y:1992:i:10:p:1495-1509
    DOI: 10.1287/mnsc.38.10.1495
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.38.10.1495
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.38.10.1495?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:38:y:1992:i:10:p:1495-1509. 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.