On various cooling schedules for simulated annealing applied to the job shop problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 260-279

  Steinhofel K ^a   Albrecht, A ^b,c   Wong, C K ^b,d  

^a FRAUNHOFER FIRST   (Germany)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c BerCom GmbH   (Germany)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COOLING; OPTIMIZATION; RANDOM PROCESSES; SIMULATED ANNEALING;

BENCH-MARK PROBLEMS; COMPLEXITY ANALYSIS; CONVERGENCE RESULTS; COOLING SCHEDULE; JOB SHOP PROBLEM; JOB SHOP SCHEDULING PROBLEMS; NEIGHBORHOOD RELATION; SECOND COOLING;

JOB SHOP SCHEDULING;

EID: 84958682913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_21     Document Type: Conference Paper

References (23)

1. E.H.L. Aarts. Local Search in Combinatorial Optimization. Wiley & Sons, New York, 1998.
2. A. Albrecht, S.K. Cheung, K.S. Leung, and C.K. Wong. Stochastic Simulations of Two-Dimensional Composite Packings. Journal of Computational Physics, 136(2):559-579, 1997.
3. O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Applications to Exponential Schedules. Annals of Probability, 20(3):1109-1146, 1992.
4. O. Catoni. Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments. Journal of Complexity, 12(4):595-623, 1996.
5. J.-H. Cho and Y.-D. Kim. A Simulated Annealing Algorithm for Resource Constrained Project Scheduling Problems. Journal of the Operational Society, 48:736-745, 1997.
6. P. Chretienne, E.G. Co man Jr., J.K. Lenstra, and Z. Liu. Scheduling Theory and Its Applications. Wiley & Sons, New York, 1998.
7. M.R. Garey and D.S. Johnson. Complexity Results for Multiprocessor Scheduling under Resource Constraints. SIAM Journal on Computing, 4(4):397-411, 1975.
8. B. Hajek. Cooling Schedules for Optimal Annealing. Mathematics of Operations Research, 13:311-329, 1988.
9. J.A. Hoogeveen, J.K. Lenstra, and S.L. van de Velde. Sequencing and Scheduling: An Annotated Bibliography. Technical Report COSOR 97-2, Dept. of Mathematics and Computing Science, Eindhoven University of Technology, 1997.
10. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220:671-680, 1983.
11. C.Y. Lee and L. Lei, editors. Scheduling: Theory and Applications. Annals of Operations Research, Journal Edition. Baltzer Science Publ. BV, Amsterdam, 1997.
12. C.Y. Lee, L. Lei, and M. Pinedo. Current Trends in Deterministic Scheduling. Annals of Operations Research, 70:1-41, 1997.
13. J.F. Muth, G.L. Thompson, and P.R. Winters, editors. Industrial Scheduling. Prentice-Hall, Englewood Cli s, N.J., 1963.
14. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall International Series in Industrial and Systems Engineering. Prentice Hall, Englewood Cli s, N.J., 1995.
15. P. Ross and D. Come. Comparing Genetic Algorithms, Simulated Annealing and Stochastic Hillclimbing on Timetabling Problems. In T.E. Fogarty, editor, Evolutionary Computing, Selected Papers, Lecture Notes in Computer Science, vol. 993, pages 94-102, 1995.
16. B. Roy and B. Sussmann. Les problemes d'Ordonnancement avec Constraints Disjonctives. Note DS No.9 bis. SEMA, 1964.
17. N.M. Sadeh and Y. Nakakuki. Focused Simulated Annealing Search: An Application to Job Shop Scheduling. Annals of Operations Research, 63:77-103, 1996.
18. J.D. Ullman. NP-Complete Scheduling Problems. Journal of Computer and System Science, 10(3):384-393, 1975.
19. R.J.M. Vaessens, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Local Search. INFORMS Journal on Computing, 8:117-302, 1996.
20. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Simulated Annealing: Theory and Applications. D. Reidel Publ. Comp., Dordrecht, 1988.
21. P.J.M. Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40(1):113-125, 1992.
22. D.P. Williamson, L.A. Hall, J.A. Hoogeveen, C.A.J. Hurkens, J.K. Lenstra, S.V. Sevast'janov, and D.B. Shmoys. Short Shop Schedules. Operations Research, 45:288-294, 1997.
23. D. Zuckerman. On Unapproximable Versions of NP-Complete Problems. SIAM Journal on Computing, 25(6):1293-1304, 1996.