๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimization of job scheduling on parallel machines by simulated annealing algorithms

โœ Scribed by Zhen-Ping Lo; B. Bavarian

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
536 KB
Volume
4
Category
Article
ISSN
0957-4174

No coin nor oath required. For personal study only.

โœฆ Synopsis

ln this paper, we 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 under job deadline constraints for n jobs, m machines problem is formulated in this paper. The simulated annealing and fast-simulated annealing algorithms are reviewed and adopted for the scheduling problem. Large numbers of simulations are carried out that provide an empirical basis for comparing the application of classical simulated annealing and fast-simulated annealing algorithms to the scheduling problem. * This work is supported in part by a grant from Hughes Aircraft Company, a subsidiary of GM Hughes Electronics and UC MICRO.

Requests for reprints should be sent to Behnam Bavarian, Department of Electric and Computer Engineering,

๐Ÿ“œ SIMILAR VOLUMES

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
โœ Zhi-Long Chen; Warren B. Powell ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o