Neural-net approach to real time flow-shop sequencing

Computers and Industrial Engineering

Volumn 38, Issue 1, 2000, Pages 125-147

  Lee, In ^a   Shaw, Michael J ^b  

^a SETON HALL UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; KNOWLEDGE BASED SYSTEMS; NEURAL NETWORKS; SCHEDULING;

FLOW-SHOP SEQUENCING;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0033724249     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00034-6     Document Type: Article

References (31)

1. Bagchi S., Uckun S., Miyabe Y., Kawamura K. Exploring problem-specific recombination operators for job shop scheduling. Proceedings of the Fourth International Conference on Genetic Algorithms and their Applications, San Diego, CA :1991;10-17.
2. Burke L.I. Neural methods for the traveling salesman problem: insights from operations research. Neural Networks. 7:(4):1994;681-690.
3. Campbell H.G., Dudek R.A., Smith M.L. A heuristic algorithm of the n-job, m-machine sequencing problem. Management Science. 16:(10):1970;B630-B637.
4. Cleveland G.A., Smith S.F. Using genetic algorithms to schedule flow shop releases. Proceedings of the Third International Conference on Genetic Algorithms and their Applications, Arlington, VA :1989;160-169.
5. Dannenbring D.G. An evaluation of flowshop sequencing heuristics. Management Science. 23:(11):1977;1174-1182.
6. Davis L. Job shop scheduling with genetic algorithms. Proceeding of the First International Conference on Genetic Algorithms and their Applications, Pittsburgh, PA :1985;136-140.
7. Freeman J.A., Skapura D.M. Neural Networks Algorithms, Applications, and Programming Techniques. 1992;Addison Wesley, Reading, MA.
8. Gabbert P.S., Brown D.E., Huntley C.L., Markowicz B.P., Sappington D.E. A system for learning routes and schedules with genetic algorithms. Proceedings of the Fourth International Conference on Genetic Algorithms and their Applications, San Diego, CA :1991;430-436.
9. Goldberg D. Genetic Algorithms in Search, Optimization and Machine Learning. 1989;Addison Wesley, Reading, MA.
10. Goldberg D., Lingle R. Alleles, loci, and the traveling salesman problem. Proceeding of the First International Conference on Genetic Algorithms and their Applications, Pittsburgh, PA :1985;154-159.
11. Gupta J.N.D. A functional heuristic algorithm for the flow-shop scheduling problem. Operations Research. 22:(1):1971;39-47.
12. Holland J.H. Adaptations in Natural and Artificial Systems. 1975;University of Michigan Press, Ann Arbor, MI.
13. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biological Cybernetics. 52:(3):1985;141-152.
14. Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly. 1:(1):1954;61-68.
15. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
16. Lee I., Sikora R., Shaw M. A genetic algorithm-based approach to flexible flow-line scheduling. IEEE Transactions on Systems, Man, and Cybernetics - Part B. Cybernetics. 27:(1):1997;36-54.
17. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Operations Research. 21:(2):1973;498-516.
18. Matsuo H., Suh C.J., Sullivan R.S. A controlled search simulated annealing method for the single machine weighted tardiness problem. Annals of Operations Research. 21:1989;85-108.
19. Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. Equation of state calculations by fast computing machines. Journal of Chemical Physics. 21:1953;1087-1092.
20. Nakano R., Yamada T. Conventional genetic algorithm for job shop problems. In Proceedings of the Fourth International Conference on Genetic Algorithms and their Applications, San Diego, CA :1991;474-479.
21. Nawaz M., Enscore E.E. Jr., Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int. J. of Mgmt. Sci. 11:(1):1983;91-95.
22. max flowshop problem. Computers Opns. Res. 17:(3):1990;243-253.
23. Oliver I.M., Smith D.J., Holland J.R.C. A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms and their Applications :1987;224-230.
24. Osman I.H., Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA Int. J. of Mgmt. Sci. 17:(6):1989;551-557.
25. Palmer D.S. Sequencing jobs through a multistage process in the minimum total time - a quick method of obtaining a near optimum. Operations Research Quarterly. 16:1965;101-107.
26. Syswerda G., Palmucci J. The application of genetic algorithms to resource scheduling. Proceedings of the Fourth International Conference on Genetic Algorithms and their Applications, San Diego, CA :1991;502-508.
27. Turner B., Booth D. Comparison of heuristics for flow shop sequencing. OMEGA Int. J. of Mgmt. Sci. 15:(1):1987;75-78.
28. van Laarhoven P.J.M., Aarts E.H.L. Simulated Annealing: Theory and Applications. 1987;Reidel, Dordrecht.
29. Wang J. A deterministic connectionist machine for the traveling salesman problem. Proceedings of IEEE International Conference on Systems, Man, and Cybernetics :1990;373-375.
30. Wang J. Neural network models and their role for optimization: an overview. ORSA CSTS Newsletter. 15:(1):1994;4-8.
31. Whitley D., Starkweather T., D'Ann Fuquay. Scheduling problems and traveling salesman. Proceedings of the Third International Conference on Genetic Algorithms and their Applications, Arlington, VA :1989;133-140.