Simulated annealing procedure for scheduling competing tasks in flexible manufacturing

Production Planning and Control

Volumn 8, Issue 4, 1997, Pages 356-362

  Hasan, Merza ^a   Alkhamis, Talal ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Flexible manufacturing; Heuristic; Simulated annealing; Travelling salesman problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROCESS CONTROL; PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING;

AUTOMATIC TOOL CHANGER (ATC); TRAVELLING SALESMAN PROBLEM (TSP);

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0031168806     PISSN: 09537287     EISSN: 13665871     Source Type: Journal    
DOI: 10.1080/095372897235163     Document Type: Article

References (20)

1. BARD, J. R., 1988, A heuristic for minimising the number of tool switches on a flexible machine. IIE Transactions, 20, 382-391.
2. CERNY, V., 1985, A thermodynamically approach to the travelling salesman problem: an efficient simulated annealing algorithm. Journal of Optimisation Theory and Applications, 45, 41-51.
3. CLARKE, G., and WRIGHT, J., 1964, Schedulingof vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581.
4. COLLINS, N. E., EGLESE, R. W., and GOLDEN, B. L., 1988, Simulatedannealing--an annotated bibliography. American Journal of Mathematical and Management Sciences, 9, 209-307.
5. CONNOLLY, D., 1992, General purpose simulated annealing. Journal of Operational Society, 43, 494-505.
6. DOWSLAND, K. A., 1993, Simulated annealing, In C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems (Blackwell Scientific, Oxford), pp. 20-69.
7. EGLESE, R. W., 1990, Simulated annealing: a tool for operational research. European Journal of Operational Research, 46, 271-281.
8. HASAN, M., and OSMAN, B., 1995, Local search algorithm for the maximal planar layout problem. International Transaction of Operational Research, 2, 89-106.
9. HARARY, F., 1971, Graph Theory (Addison Wesley, Reading, MA).
10. KIRKPATRICK, S., GELATT, C. D., and VECCHI, P. M., 1983, Optimisation by simulated annealing. Science, 220, 671-680.
11. LIN, S., and KERRIGHAN, B., 1973, An effective heuristic algorithm for the travelling salesman problem. Operations Research, 11, 972-989.
12. METROPOLIS, N., ROSENBLUTH, A., ROSENBLUTH, M., TELLER, M., and TELLER, E., 1953, Equation of steady state calculation by fast computing machine. Journal of Chemical Physics, 21, 1087-1092.
13. OSMAN, I. H., and CHRISTOFIDES, N., 1994, Simulated annealing and descent algorithms for capacitated clustering problem. Research Report, Imperial College, University of London.
14. OSMAN, I. H., and LAPORT, G., 1994, Modern heuristics for combinatorial optimisation problems: an annotated bibliography, In Osman, I. H., and Laport, G., 1994 (eds), Metaheuristic in Combinatorial Optimisation. Annuals of Operations Research, (Forthcoming).
15. POSNER, M. E., 1986, A sequencing problem with release dates and clustered jobs. Management Science, 32, 731-738.
16. REMCO, F., and SANGIOVANNI-VINCENTELLI, A., 1985, Probabilistic hill climbing algorithms: properties and applications. In Proceedings Chapel Hill Conference on VLSI, Chapel Hill, NC, pp. 393-471.
17. SIDNEY, J. B., 1975, Decomposition algorithms for single machine sequencing with precedence relations and deferral costs. Operations Research, 23, 283-298.
18. SULE, D. R., 1993, Job sequencing to minimise tool changeovers in flexible manufacturing systems. Production Planning and Control, 4, 46-53.
19. VAN LAARHOVEN, P., and AARTS, E., 1987, Simulated Annealing: Theory and Application (D. Reidel, Dordrecht).
20. VAN LAARHOVEN, P., AARTS, E., and LENSTRA, J., 1992, Job shop schedulingby simulated annealing.Operations Research, 40, 113-125.