DocumentCode
3136612
Title
A modified simulated annealing method for flexible job shop scheduling problem
Author
Najid, Najib M. ; Dauzere-Pérès, Stephane ; Zaidat, Ali
Author_Institution
Inst. de Recherche en Commun. et Cybernetique de Nantes, CNRS, Nantes, France
Volume
5
fYear
2002
fDate
6-9 Oct. 2002
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. A generalized job shop problem is defined in detail. A variation of the simulated annealing method is proposed and computational results are provided.
Keywords
flexible manufacturing systems; production control; search problems; simulated annealing; computational results; flexible job shop scheduling; modified simulated annealing method; simulated annealing; Job shop scheduling; Polynomials; Routing; Search methods; Simulated annealing;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man and Cybernetics, 2002 IEEE International Conference on
ISSN
1062-922X
Print_ISBN
0-7803-7437-1
Type
conf
DOI
10.1109/ICSMC.2002.1176334
Filename
1176334
Link To Document