IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v70y1997i0p281-30610.1023-a1018930406487.html
   My bibliography  Save this article

An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

Author

Listed:
  • Stéphane Dauzère-Pérès
  • Jan Paulli

Abstract

The problem considered in this paper is an important extension of the classical job-shop scheduling problem, where the same operation can be performed on more than one machine. The problem is to assign each operation to a machine and to sequence the operations on the machines, such that the makespan of a set of jobs is minimized. We introduce an extended version of the disjunctive graph model, that is able to take into account the fact that operations have to be assigned to machines. This allows us to present an integrated approach, by defining a neighborhood structure for the problem where there is no distinction between reassigning or resequencing an operation. This neighborhood is proved to be connected. A tabu search procedure is proposed and computational results are provided. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Stéphane Dauzère-Pérès & Jan Paulli, 1997. "An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search," Annals of Operations Research, Springer, vol. 70(0), pages 281-306, April.
    • Handle: RePEc:spr:annopr:v:70:y:1997:i:0:p:281-306:10.1023/a:1018930406487
    DOI: 10.1023/A:1018930406487
    as

    Download full text from publisher

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

    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:70:y:1997:i:0:p:281-306:10.1023/a:1018930406487. 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.