By Topic

Job scheduling on parallel machines using simulated annealing

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
$33 $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

2 Author(s)
Lo, Z.-P. ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; Bavarian, B.

The authors consider the problem of scheduling a set of simultaneously available jobs on several parallel machines. Specifically, the minimization of the time to finish all the jobs assigned to all machines of scheduling sequence under job deadline constraints for the n jobs, m machines problem is formulated. The simulated annealing and fast simulated annealing algorithms are reviewed and adopted for the scheduling problem. A large number of simulations were carried out which provides an empirical basis for comparing the application of classical simulated annealing and fast simulated annealing algorithms to the scheduling problem

Published in:

Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on

Date of Conference:

13-16 Oct 1991