Job-shop scheduling using neural networks

International Journal of Production Research

Volumn 36, Issue 5, 1998, Pages 1249-1272

  Jain, A S ^a   Meeran, S ^a  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BACKPROPAGATION; COMPUTER SIMULATION; CONSTRAINT THEORY; INVENTORY CONTROL; MATHEMATICAL MODELS; NEURAL NETWORKS; OPTIMIZATION; PERSONAL COMPUTERS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

HOPFIELD NEURAL NETWORKS; JOB SHOP SCHEDULING;

PRODUCTION CONTROL;

EID: 0032070930     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075498193309     Document Type: Article

References (84)

1. Adams, J., Balas, E., and Zawack, D., 1988, The shifting bottleneck procedure for job-shop scheduling. Management Science, 34 (3), 391-401.
2. Aiyer, S. V. B., Niranjan, M., and Fallside, F., 1990, A theoretical investigation into the performance of the Hopfield model. IEEE Transactions on Neural Networks, 1, 204-215.
3. Alvehus, M., 1997, The shifting bottleneck procedure: a survey. Graduate Course Report, Linkoping University, Linkoping, Sweden.
4. Applegate, D., and Cook, W., 1991, A computational study of the job-shop scheduling problem. ORSA Journal of Computing, 3, 149-156.
5. Balas, E., 1969, Machine scheduling via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, 941-957.
6. Berenson, M. L., Levine, D. M., and Rindskopf, D., 1988, Applied Statistics: A First Course (Englewood Cliffs, NJ: Prentice Hall).
7. Blackstone, J. H., Jr, Philips, D. T., and Hogg, G. L., 1982, A state of the art survey of dispatching rules for manufacturing job-shop operations. International Journal of Production Research, 20, 27-45.
8. BlaZewicz, J., Domschke, W., and Pesch, E., 1966, The job-shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research, 93 (1), 1-33.
9. Carlier, J., and Pinson, E., 1989, An algorithm for solving the job shop problem. Management Science, 35 (2), 164-176.
10. Cedimoglu, I. H., 1993, Neural networks in shop floor scheduling. Ph.D. thesis, School of Industrial and Manufacturing Science, Cranfield University, UK.
11. Chang, S. H., and Nam, B. H., 1993, Linear programming neural networks for job-shop scheduling. Proceedings of the IJCNN’93 International Joint Conference on Neural Networks, Nagoya, Japan, 25-29 October, 2, 1557-1560.
12. Cherkassy, V., and Zhou, D. N., 1992, Comparison of conventional and neural network heuristics for job-shop scheduling. Proceedings of the SPIE-International Society for Optical Engineering, Orlando, FA, April 21-24, 2, 815-825.
13. Cheung, J. Y., 1994, Scheduling. In Artificial Neural Networks for Intelligent Manufacturing, C. H. Dagli (ed.) (London: Chapman &Hall), pp. 159-193.
14. Conway, R. W., Maxwell, W. L., and Miller, L. W., 1967, Theory of Scheduling (Reading, MA: Addison-Wesley).
15. Cook, S. A., 1971, The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on the Theory of Computing, New York, pp. 151-158.
16. DARPA, 1988, Neural Network Study (Fairfax, VA: AFCEA International Press), November.
17. Dell’ Amico, M., and Trubian, M., 1993, Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 4, 231-252.
18. Dongarra, J. J., 1996, Performance of various computers using standard linear equations software. Technical report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, Tn 37996-1301, USA.
19. Fisher, H., and Thompson, G. L., 1963, Probabilistic learning combinations of local jobshop scheduling rules. In Industrial Scheduling, J. F. Muth and G. L. Thompson (eds) (Englewood Cliffs, New Jersey: Prentice Hall), pp. 225-251.
20. Foo, S. Y., and Takefuji, Y., 1988a, Stochastic neural networks for solving job-shop scheduling: part 1. Problem representation. In Proceedings of the 1988 IEEE International Conference on Neural Networks, B. Kosko (ed.), San Diego, California, 24-27 July, 2, 275-282.
21. Foo, S. Y., and Takefuji, Y., 1988b, Stochastic neural networks for solving job-shop scheduling: part 2. Architecture and simulations. In Proceedings of the 1988 IEEE International Conference on Neural Networks, B. Kosko (ed.), San Diego, California, 24-27 July, 2, 283-290.
22. Foo, S. Y., and Takefuji, Y., 1988c, Integer linear programming neural networks for jobshop scheduling. In Proceedings of the 1988 IEEE International Conference on Neural Networks, B. Kosko (ed.), San Diego, California, 24-27 July, 2, 341-348.
23. Foo, S. Y., Takefuji, Y., and Szu, H., 1995, Scaling properties of neural networks for jobshop scheduling. Neurocomputing, 8 (1), 79-91.
24. Fu, L. M., 1996, Knowledge and neural heuristics. Tutorial 5 Notes, IEEE International Conference on Neural Networks, 2nd June, pp. 106.
25. Garey, M. R., and Johnson, D. S., 1979, Computers and Intractability: A Guide to the Theory of NP-Completeness (San Francisco: W. H. Freeman).
26. Gernoth, K. A., and Clark, J. W., 1995, Neural networks that learn to predict probabilities-global-models of nuclear-stability and decay. Neural Networks, 8/2, 291-311.
27. Glover, F., 1995, Tabu search fundamentals and uses. Working paper, College of Business and Administration and Graduate School of Business Administration, University of Colorado, Boulder, CO, June (revised and expanded), pp. 87.
28. Glover, F., Kelly, J. P., and Laguna, M., 1995, Genertic algorithms and tabu search: hybrids for optimization. Computers and Operations Research, 22 (1), 111-134.
29. Glover, F., and Laguna, M., 1993, Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, C. R. Reeves (ed.) (Oxford, UK: Blackwell Scientific Publications), pp. 70-141.
30. Goodacre, R., Trew, S., Wrigley Jones, C., Saunders, G., Neal, M. J., Porter, N., and Kell, D. B., 1995, Rapid and quantitative-analysis of metabolities in fermenter broths using pyrolysis mass-spectrometry with supervised learning-application to the screening of pencillium-chrysogenum fermentations for the overproduction of penicillins. Analytica Chimica Acta, 313 (1-2), 25-43.
31. Haykin, S., 1994, Neural Networks: A Comprehensive Foundation (New York: Macmillan College Publishing).
32. Hinton, G. E., Sejnowski, T. J., and Ackley, D. H., 1984, Boltzmann machines: constraint satisfaction networks that learn. Technical report CMU-CS-84-119, Department of Computer Science, Carnegie Mellon University, Pennsylvania, USA.
33. Hopfield, J. J., and Tank, D. W., 1985, Neural computational of decisions in optimization problems. Biological Cybernetics, 52, 141-152.
34. Jadid, M. N., and Fairbairn, D. R., 1995, Adjustments of error by neural networks for the shear-stress carried by the stirrups of a beam-column joint. Expert Systems with Applications, 9 (3), 257-269.
35. Jain, A. S., 1995, Solving NP-hard combinatorially exploding problems using neural networks. Honours Project report, Department of Applied Physics and Electronic and Mechanical Engineering, University of Dundee, Dundee, Scotland.
36. Johnson, S. M., 1954, Optimal two- and three-stage production schedules with set-up times included. Naval Reserves Logistics Quarterly, 1, 61-68.
37. Keymeulen, D., and de Gerlache, M., 1993, Comparison training for a rescheduling problem in neural networks. In Advances in Neural Information Processing Systems NIPS’6 Conference, J. D. Cowan, G. Tesauro, and J. Alspector (eds), Denver, Colorado, November 29-December 2 (San Francisco: Morgan Kaufmann), pp. 801-808.
38. Kim, S. Y., Lee, Y. H., and Agnihotri, D., 1995, A hybrid approach for sequencing jobs using heuristic rules and neural networks. Production Planning and Control, 6 (5), 445454.
39. Kirkpatrick, S., Gelatt, C. D. Jr, and Vecchi, M. O., 1983, Optimization by simulated annealing. Science, 220 (4598), 671-680.
40. Kobayashi, Y., and Nohaka, H., 1990, Application of neural network to schedule integration in plant engineering. International Neural Network Conference, Paris, France, pp. 287-290.
41. Kohonen, T., 1987, Representation of sensory information in self-organising feature maps, and relation of these maps to distributed memory networks. SPIE 1987 The International Society of Optical Engineering, Bellingham, Washington, March, pp. 248-259.
42. Kolmogorov, A. N., 1957, On the representation of continuous functions of several variables by superposition of continuous functions of one variable and addition (in Russian). Doklady Akademiia Nauk SSR, 114 (5), 953-956 (American Mathematical Society Translation, 1963, 28, 55-59).
43. Kunz, D., 1991, Suboptoimal solutions obtained by the Hopfield-Tank neural network algorithm. Biological Cybernetics, 65, 129-133.
44. Lawrence, S., 1984, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Supplement, Graduate School of Industrial Administration, Carnegie Mellon University, Pennsylvania, USA.
45. Lee, Y. H., Bhaskaran, K., and Pinedo, M., 1992, A heuristic to minimise the total weighted tardiness with sequence dependent set-ups. Technical report, IEOR Dept, Columbia University, New York, USA.
46. Lippman, R. P., 1987a, Comparison between neural nets and conventional classifiers. Proceedings of the IEEE First International Conference on Neural Networks, June, pp. 485-493.
47. Lippmann, R. P., 1987b, An introduction to computing with neural nets. IEEE ASSP Magazine, April, 4-22.
48. Lo, Z.-P., and Bavarian, B., 1993, Multiple-job scheduling with artificial neural networks. Computers and Electrical Engineering, 19 (2), 87-101.
49. LourenCo, H. R. D., and Zwijnenburg, M., 1966, Combining the large-step optimization with tabu-search: application to the job-shop scheduling problem. In Meta-heuristics: Theory and Applications, I. H. Osman and J. P. Kelley (eds) (Boston, MA: Kluwer Academic Publishers), pp. 219-236.
50. Martin, P. D., 1996, A time-oriented approach to computing optimal schedules for the jobshop scheduling problem, Ph.D. thesis, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853-3801, USA.
51. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., and Teller, E., 1953, Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21 (6), June, 1087-1092.
52. Minsky, M., and Papert, S., 1969, Perceptrons: An Introduction to Computational Geometry (Cambridge, MA: MIT Press).
53. Nowicki, E., and Smutnicki, C., 1996, A fast taboo search algorithm for the job-shop problem. Management Science, 42 (6), 7697-813.
54. Pattichis, C. S., Schizas, C. N., and Middleton, L. T., 1995, Neural-network models in EMG diagnosis. IEEE Transactions on Biomedical Engineering, 42 (5), 486-496.
55. Pomerleau, D. A., 1993, Neural Network Perception for Mobile Robot Guidance (Boston, MA: Kluwer).
56. Potvin, J. Y., Shen, Y., and Rousseau, J. M., 1992, Neural networks for automated vehicle dispatching. Computers Operation Research, 19 (3/4), 267-276.
57. Rabelo, L. C., and Alptekin, S., 1989a, Using hybrid neural networks/expert systems for intelligent scheduling in flexible manufacturing systems. Proceedings of the IJCNN International Joint Conference on Neural Networks, Washington, June 18-22, 2, pp. 608.
58. Rabelo, L. C., and Alptekin, S., 1989b, Synergy of neural networks and expert systems for FMS scheduling. In Proceedings of the Third ORSA/TIMS FMS Conference: Operation Research Models and Applications, K. E. Stecke and R. Suri (eds), Amsterdam, pp. 361-366.
59. Rabelo, L. C., and Alptekin, S., 1990a, Adaptive scheduling and control using artificial neural networks and expert systems for a hierarchical/distributed FMS architecture. Proceedings of Rensselaer' s Second International Conference on Computer Integrated Manufacturing (IEEE), Troy, New York, May 21-23, pp. 538-545.
60. Rabelo, L. C., and Alptekin, S., 1990b, Synergy of artificial neural networks and knowledge-based expert systems for intelligent FMS scheduling. IJCNN International Joint Conference on Neural Networks, San Diego, CA, Jun. 17-21, 1, pp. 359-366.
61. Rosenblatt, F., 1958, The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review, 65, 386-408. Reprinted in Anderson and Rosenfield, 1988, pp. 92-114.
62. Rowe, A. J., and Jackson, J. R., 1956, Research problems in production routing and scheduling. Journal of Industrial Engineering, 7, 116-121.
63. Rumelhart, D. E., Hinton, G. E., and Williams, R. J., 1986, Learning internal representations by error propagation. In Parallel Distributed Processing, vol. 1, D. E. Rumelhart and J. L. McClelland (eds) (Cambridge, MA: MIT Press), pp. 318-362.
64. Sabuncuoglu, I., and Gurgun, B., 1996, A neural network model for scheduling problems. European Journal of Operations Research, 93 (2), Sept., 288-299.
65. Sastri, T., and Malave, C. O., 1991, Identification of the optimal control policy for the Markov devision process by back propagation. In Intelligent Engineering Systems Through Artificial Neural Networks, C. H. Dagli, S. R. T. Kumara, and Y. C. Shin (eds) (New York: ASME), pp. 873-881.
66. Satake, T., Morikawa, K., and Nakamura, N., 1994, Neural network approach for minimizing the makespan of the general job-shop. International Journal of Production Economics, 33 (1-3), 67-74.
67. Shmoys, D. B., Stein, C., and Wein, J., 1994, Improved approximation algorithms for shop scheduling problems. SIAM Journal of Computing, 23 (3), 617-632.
68. Sim, S. K., Yeo, K. T., and Lee, W. H., 1994, An expert neural network system for dynamic job-shop scheduling. International Journal of Production Research, 32 (8), 1759-1773.
69. Smit, G. H., 1992, A hierarchical control architecture for job-shop manufacturing systems. MSc Thesis, Eindhoven University of Technology, Eindhoven, Netherlands.
70. Smith, K., Palaniswami, M., and Krishnamoorthy, M., 1996, Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem. European Journal of Operations Research, 93 (2), 300-316.
71. Smith, W. E., 1956, Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59-66.
72. Taillard, E., 1993, Benchmarks for basic scheduling problems. European Journal of Operations Research, 64 (2), 278-285.
73. Vaessens, R. J. M., Aarts, E. H. L., and Lenstra, J. K., 1996, Job-shop scheduling by local search. INFORMS Journal on Computing, 8, 302-317.
74. Vepsalainen, A., and Morton, T. E., 1987, Priority rules for job shops with weighted tardiness costs. Management Science, 33, 1035-1047.
75. Wang, J., and Teng, T. L., 1995, Artificial neural-network-based seismic detector. Bulletin of the Seismological Society of America, 85 (1), 308-319.
76. Willems, T. M., and Rooda, J. E., 1994, Neural networks for job-shop scheduling. Control Engineering Practice, 2 (1), 31-39.
77. Wilson, G. V., and Pawley, G. S., 1988, On the stability of the travelling salesman problem algorithm of Hopfield and Tank. Biological Cybernetics, 58, 63-70.
78. Yamada, T., and Nakano, R., 1996a, Job-shop scheduling by simulated annealing combined with deterministic local search. In Meta-heuristics: Theory and Applications, I. H. Osman and J. P. Kelly (eds) (Boston: Kluwer Academic Publishers), pp. 237-248.
79. Yamada, T., and Nakano, R., 1996b, A fusion of crossover and local search. Proceedings of the ICIT96 IEEE International Conference on Industrial Technology, December 2-6, Shanghai, China.
80. Yih, Y., Liang, T.-P., and Moskowitz, H., 1991, A hybrid approach for crane scheduling problems. In Intelligent Engineering Systems Through Arti® cial Neural Networks, C. H. Dagli, S. R. T. Kumara and Y. C. Shin (eds) (New York: ASME), pp. 867-872.
81. Zhang, C. S., Yan, P. F., and Chang, T, 1991, Solving job-shop scheduling problem with priority using neural network. Proceedings of the IJCNN’91 International Joint Conference on Neural Networks, November 18-21, 2, 1361-1366.
82. Zhang, H.-C., and Huang, S. H., 1995, Applications of neural networks in manufacturing: a state-of-the-art survey. International Journal of Production Research, 33 (3), 705-728.
83. Zhou, D. N., Cherkassy, V., Baldwin, T. R., and Olson, D. E., 1991, A neural network approach to job-shop scheduling. IEEE Transactions on Neural Networks, 2 (1), 175-179.
84. Zhuang, X., Shi, H., and Zhao, Y., 1996, A general auto-associative memory model, Proceedings of the ICNN’96 IEEE Intenational Conference on Neural Networks, Washington DC, USA, June 2-6, pp. 549-554.