By Topic

A modified simulated annealing method for flexible job shop scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Najid, N.M. ; Inst. de Recherche en Commun. et Cybernetique de Nantes, CNRS, Nantes, France ; Dauzere-Peres, S. ; Zaidat, A.

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.

Published in:

Systems, Man and Cybernetics, 2002 IEEE International Conference on  (Volume:5 )

Date of Conference:

6-9 Oct. 2002