论文信息 - Optimization of job scheduling on parallel machines by simulated annealing algorithms

Optimization of job scheduling on parallel machines by simulated annealing algorithms

Abstract In 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.

Zhen-Ping Lo | B. Bavarian

[1] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[2] T.C.E. Cheng,et al. A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[4] Scott Kirkpatrick,et al. Optimization by Simmulated Annealing , 1983, Sci..

[5] Kut C. So,et al. Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[6] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..

[7] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[8] Z.-P. Lo,et al. Scheduling with neural networks for flexible manufacturing systems , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.