Job scheduling on parallel machines using simulated annealing
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 391-396 vol.1
- https://doi.org/10.1109/icsmc.1991.169716
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Scheduling with neural networks for flexible manufacturing systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some Heuristics for Scheduling Jobs on Parallel Machines with SetupsManagement Science, 1990
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel MachinesJournal of the Operational Research Society, 1989
- Convergence of an annealing algorithmMathematical Programming, 1986
- Optimization by Simulated AnnealingScience, 1983
- Sequencing Research and the Industrial Scheduling ProblemPublished by Springer Nature ,1973
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953