Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing

Volumn 37, Issue 2, 1996, Pages 207-212

  Janaki Ram, D ^a   Sreenivas, T H ^a   Ganapathy Subramaniam, K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030587314     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0121     Document Type: Article

References (15)

1. 1. Greening, Daniel R., Parallel simulated annealing techniques, Physica D 42 (1990), 293-306.
2. 2. Van Laarhoven, P. J. M., Aarts, E. H. L., and Lenstra, Jan Karel. Job shop scheduling by simulated annealing. In Operation Research, Vol. 40. 1992, pp. 113-125.
3. 3. Janaki Ram, D., and Ganeshan, K. DiPS: A system for implementing and analyzing distributed algorithms. Tech. Rep. IITM-CSE-93-001, Indian Institute of Technology, Madras.
4. 4. French, Simon. Sequencing and Scheduling: An Introduction to the Mathematics of Job Shop. Wiley, New York.
5. 5. Eglese, R. W. Simulated annealing: A tool for operation research. In Eur. J. Oper. Res. 46 (1990), 271-281.
6. 6. Allwright, James R. A., and Carpenter, D. B., A distributed implementation of simulated annealing for the traveling salesman problem. In Parallel Comput. 10 (1989), 335-338.
7. 7. Decker, Keith S., Distributed problem solving techniques: A survey. In IEEE Trans. Systems Man Cybernet. 17 (1987), 729-739.
8. 8. Adams, J., Balas, E., and Zawack, D. The shifting bottleneck procedure for job shop scheduling. Mgmt. Sci. 34 (1988), 391-401.
9. 9. Abramson, David. A very high speed architecture for simulated annealing. IEEE Comput. (May 1992), 27-36.
10. 10. Ganeshan, K. Designing and implementing flexible distributed problem solving systems. M.S. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Madras, 1993.
11. 11. Syswerda, Gilbert. Schedule optimization using genetic algorithms. In Davis, L. (Ed.). Handbook of Genetic Algorithms. pp. 332-349.
12. 12. Krishan, K. Ganeshan, and Ram, D. Janaki. Distributed simulated annealing algorithms for job shop scheduling. IEEE Trans. Systems Man Cybernet. 25, 7 (July 1995), 1102-1109.
13. 13. Gu and Huang, X. Efficient local search with search space smoothing. IEEE Trans. Systems Man Cybernet. 24, 5 (May 1994), 728-735.
14. 14. Whitley, Darrel, Starkweather, Timothy, and Shaner, Daniel. Schedule optimization using genetic algorithms. In Davis, Lawrence (Ed.). pp. 351-357.
15. 15. Nowicki, E., and Smutnicki, C. A fast tabu search algorithm for the job shop problem. Report 8/93, Institute of Engineering Cybernetics, Technical University of Wroclaw, 1993. To appear in ORSA J Comput.