An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
Stéphane Dauzère-Pérès and
Jan Paulli
Annals of Operations Research, 1997, vol. 70, issue 0, 306 pages
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
Keywords: Analysis of algorithms; suboptimal algorithms: tabu search; production/scheduling; sequencing; deterministic; multiple machine; multiprocessor; job-shop scheduling; disjunctive graph model (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (50)
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018930406487 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:70:y:1997:i:0:p:281-306:10.1023/a:1018930406487
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018930406487
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().