Focused simulated annealing search: An application to job shop scheduling

Annals of Operations Research

Volumn 63, Issue , 1996, Pages 77-103

  Sadeh, Norman M ^a   Nakakuki, Yoichiro ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344453725     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02601640     Document Type: Article

References (27)

1. K.R. Baker, Introduction to Sequencing and Scheduling (Wiley, 1974).
2. V. Cerny, Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm, J. Opt. Theory Appl. 45(1985)41-51.
3. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop (Wiley, 1982).
4. T. Fry, R. Amstrong and J. Blackstone, Minimizing weighted absolute deviation in single machine scheduling, IIE Trans. 19(1987)445-450.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).
6. M.R. Garey, R.E. Tarjan and G.T. Wilfgong, One-processor scheduling with symmetric earliness and tardiness penalties, Math. Oper. Res. 13(1988)330-348.
7. F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977) 156-166.
8. F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 13(1986)533-549.
9. F. Glover, Tabu thresholding: Improved search by non-monotonic trajectories, Technical Report, Graduate School of Business, University of Colorado, Boulder, CO 80309-0419 (1993).
10. F. Glover and M. Laguna, Tabu search, in: Modern Heuristic Techniques for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, Oxford, 1992) pp. 70-150.
11. J. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, MI, 1975).
12. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by sumulated annealing: Experimental evaluation. Part I: Graph partitioning, Oper. Res. 37(1989)865-892.
13. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: Experimental evaluation. Part II: Graph coloring and number partitioning, Oper. Res. 39(1991) 378-406.
14. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983) 671-680.
15. M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Syst. Appl. 6(1993)287-297.
16. H. Matsuo, C.J. Suh and R.S. Sullivan, A controlled search simulated annealing method for the general job shop scheduling problem, Technical Report, Department of Management, The University of Texas at Austin, Austin, TX (1988).
17. T.E. Morton, SCHED-STAR: A price-based shop scheduling module, J. Manufac. Oper. Manag. (1988) 131-181.
18. T.E. Morton and D.W. Pentico, Heuristic Scheduling Systems, Wiley Series in Engineering and Technology Management (1993).
19. E. Nowicki and C. Smutnicki, A fast tabu search algorithm for the job shop problem, Technical University of Wroclaw, Institute of Engineering Cybernetics, ul. Janiszewskiego 1/17, 50-372 Wroclaw, Poland (1993).
20. I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, OMEGA Int. J. Manag. Sci. 17(1989)551-557.
21. I.H. Osman, Meta-strategy simulated annealing and tabu search algorithms for the vehicle routing problem, Ann. Oper. Res. 41(1993)421-451.
22. P.S. Ow and T. Morton, The single machine early/tardy problem, Manag. Sci. 35(1989)177-191.
23. N. Sadeh, Look-ahead techniques for micro-opportunistic job shop scheduling, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 (March 1991).
24. N. Sadeh, Micro-opportunistic scheduling: The micro-boss factory scheduler, in: Intelligent Scheduling, ed. Zweben and Fox (Morgan Kaufmann, 1994) Chap. 4.
25. E. Taillard, Parallel tabu search techniques for the job shop scheduling problem, ORSA J. Comp. 6(1994)108-117.
26. P.J. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Oper. Res. 40(1992)113-125.
27. A.P.J. Vepsalainen and T.E. Morton, Priority rules for job shops with weighted tardiness costs, Manag. Sci. 33(1987)1035-1047.