Skip to main content
SpringerLink
Log in
Book cover

Artificial Neural Networks for Intelligent Manufacturing pp 159–193Cite as

Scheduling

  • Chapter

Part of the book series: Intelligent Manufacturing Series ((IMS))

Abstract

An important aspect of automation in manufacturing systems is scheduling. The need for scheduling occurs at every level of the manufacturing process — from scheduling purchase of components and subcomponents, scheduling jobs and machines in the making and asembling process, to scheduling picking, packaging, shipping, etc. Furthermore, scheduling in material handling can occur at more than one level with varying degrees of detail and sophistication, e.g. a month-to-month schedule for orders and component purchase, a week-to-week schedule for components on the assembly line, a day-to-day schedule for jobs to be done in the machine shop, or an hour-by-hour schedule for each machine in the shop. With the emphasis of just-in-time manufacturing and production, scheduling is particularly important to ensure smooth operation of all phases of the entire manufacturing process.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aarts, E. and Korst, J. (1989) Simulated Annealing and Boltzmann Machines, Wiley, New York.

    MATH  Google Scholar 

  • Abe, S. (1990) Convergence of the Hopfield neural networks with inequality, Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 869–74.

    Google Scholar 

  • Abe, S. (1991) Global convergence and suppression of spurious states of the Hopfield neural networks, Proceedings of the International Joint Conference on Neural Networks — Singapore, I, 936–40.

    Google Scholar 

  • Ackley, D.H., Hinton, G.E. and Sejnowski, T.J. (1985) A learning algorithm for Boltzmann machines. Cognitive Science, 9, 147–69.

    Article  Google Scholar 

  • Adorf, H.M. and Johnston, M.D. (1990) A discrete stochastic neural network algorithm for constraint satisfaction problems, Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 917–24.

    Google Scholar 

  • Aiyer, S.V.B., Niranjan, M. and Fallside, F. (1990a) A theoretical investigation into the performacne of the Hopfield model, IEEE Transactions on Neural Networks, 1, 204–15.

    Article  Google Scholar 

  • Aiyer, S.V.B., Niranjan, M. and Fallside, F. (1990b) On the optimization properties of the Hopfield model, Proceedings of the International Neural Network Conference — Paris, I, 245–8.

    Google Scholar 

  • Akiyama, Y., Yamashita, A., Kajiura, M. and Asio, H. (1989) Combinatorial optimization with Gaussian machines, Proceedings of the International Joint Conference on Neural Networks — Washington, DC., I, 533–540.

    Article  Google Scholar 

  • Alfa, A.S., Heragu, S.S. and Chen, M. (1991) A 3-opt based simulated annealing algorithm for vehicle routeing problems. Computers Industrial Engineering, 21, (1–4), 635–9.

    Article  Google Scholar 

  • Anderson, J. R. and Peterson, C. (1988) Applicability of mean field theory neural network methods to the graph partitioning problems. MCC-ACA-ST-064-88.

    Google Scholar 

  • Angeniol, B., Vaubois, G. de la C. and le Texier, J.Y. (1988) Self-organizing feature maps and the TSP. Neural Networks, 3, 289–93.

    Article  Google Scholar 

  • Badami, V.S. and Parks, C.M. (1991a) A classifier based approach to flow shop scheduling. Computers Industrial Engineering, 21(1–4), 329–33.

    Article  Google Scholar 

  • Badami, V.S. and Parks, C.M. (1991b) A classifier based approach to flow shop scheduling. Computers Industrial Engineering, 21(1–4), 401–5.

    Article  Google Scholar 

  • Beyer, D.A. and Ogier, R.G. (1991) Tabu learning: a neural network search method for solving nonconvex optimization problems, Proceedings of the International Joint Conference on Neural Networks — Singapore, I, 953–61.

    Google Scholar 

  • Bibro, G., Mann, R., Miller, T.K., Synder, W.E., Van den Bout, D.E. and While, M. (1989) Optimization by mean field annealing, in Advances in Neural Information Processing Systems, (ed. D.S. Touretzky), Kaufman, 91–8.

    Google Scholar 

  • Bizzarri, A.R. (1991) Convergence properties of a modified Hopfield-tank model. Biological Cybernetics, 64, 293–300.

    Article  MathSciNet  Google Scholar 

  • Bonomi, E. and Lutton, J.L. (1984) The N-city traveling salesman problem: statistical mechanics and the metropolis algorithms. SIAM Reviews, 26(4), 551–568.

    Article  MathSciNet  MATH  Google Scholar 

  • Bozovsky, P. (1990) Discrete Hopfield model with graded response (analysis and applications), Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 651–6.

    Google Scholar 

  • Brandt, R.D., Wang, Y., Laub, A.J. and Mitra, S.K. (1988) Alternative networks for solving the TSP and the list-matching problem, Proceedings of the International Conference on Neural Networks — San Diego, II, 333–40.

    Article  Google Scholar 

  • Bruck, J. and Goodman, J.W. (1988) A generalized convergence theorem for neural networks and its applications in combinatorial optimization. IEEE Transactions on Information Theory, 34, 1089–92.

    Article  MathSciNet  Google Scholar 

  • Bruck, J. and Goodman, J.W. (1990) On the power of neural networks for solving hard problems. Journal of Complexity, 6, 129–35.

    Article  MathSciNet  MATH  Google Scholar 

  • Burke, L.I. and Damany, P. (1992) The guilty net for the traveling salesman problem. Computers Operation Research, 19(3/4), 255–65.

    Article  MATH  Google Scholar 

  • Cervantes, J.H. and Hildebrant, R.R. (1987) Comparison of three neuron-based computation schemes, Proceedings of the International Conference on Neural Networks — San Diego, III, 657–91.

    Google Scholar 

  • Chakrapani, J. and Skorin-Kapov, J. (1992) A connectionist approach to the quadratic assignment problem. Computers Operation Research, 19(3/4), 287–95.

    Article  MATH  Google Scholar 

  • Chen, C.L.P. and Yan, Q.-W. (1991) Design of a case associative assembly planning system, in Intelligent Engineering Systems Through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), ASME, 757–62.

    Google Scholar 

  • Chiu, C, Maa, C.Y. and Shanblatt, M.A. (1990) An artificial neural network algorithm for dynamic programming. International Journal of Neural Systems, 1, 211–20.

    Article  Google Scholar 

  • Connolly, D.T. (1990) An improved annealing scheme for the QAP. European Journal of Operational Research, 46, 93–100.

    Article  MathSciNet  MATH  Google Scholar 

  • Creutz, M. (1983) Microcanonical Monte-Carlo simulation. Physical Review Letters, 50(19), 1411–14.

    Article  MathSciNet  Google Scholar 

  • Culioli, J.-C., Protopopescu, V., Britton, C.L. and Ericson, M.N. (1990a) Neural network models for linear programming, Proceedings of the International Joint Conference Neural Networks, I, 293–6.

    Google Scholar 

  • Culioli, J.-C., Protopopescu, V., Britton, C.L. and Ericson, M.N. (1990b) Neural network for explicitly bounded linear programming, Proceedings of the International Joint Conference Neural Networks, I, 381–4.

    Google Scholar 

  • Cuykendall, R. and R. Reese, (1989) Scaling the neural TSP algorithm. Biological Cybernetics, 60, 365–71.

    Article  MathSciNet  MATH  Google Scholar 

  • Dagli, C.H., Lammers, S. and Vellanki, M. (1991) Intelligent scheduling in manufacturing using neural networks. Journal of Neural Network Computing, 2, 4–10.

    Google Scholar 

  • Dahl, E.D. (1987) Neural Network Algorithm for an NP-complete problem: map and graph coloring, Proceedings of the International Conference on Neural Networks — San Diego, III, 113–20.

    Google Scholar 

  • De Carvalho, L.A.V. and Barbosa, V.C. (1990) A TSP objective function that ensures feasibility at stable points, Proceedings of the International Neural Network Conference — Paris, I, 249–53.

    Google Scholar 

  • Derthick, M. and Tebelskis, J. (1988) ‘Ensemble’ Boltzmann units have collective computational properties like those of Hopfield and tank neurons, Neural Information Processing Systems, American Institute of Physics, 223–32.

    Google Scholar 

  • Dickey, J.W. and Hopkins, J.W. (1972) Campus building arrangement using TOPAZ. Transportation Research, 6, 59–68.

    Article  Google Scholar 

  • Durbin, R. and Willshaw, D. (1987) An analogue approach to the TSP using an elastic net method. Nature, 326, 689–91.

    Article  Google Scholar 

  • Durbin, R., Szeliski, R. and Yuille, A.L. (1989) An analysis of the elastic net approach to the TSP. Neural Computing, 1, 348–58.

    Article  Google Scholar 

  • Elshafei, A.N. (1977) Hospital layout as a quadratic assignment problem. Operational Research Quarterly, 28, 167–79.

    Article  MATH  Google Scholar 

  • Fang, L. and Li, T. (1990) Design of competition-based neural networks for combinatorial optimization. International Journal of Neural Systems, I, 221–35.

    Article  Google Scholar 

  • Fang, L., Wilson, W.H. and Li, T. (1990) Mean field annealing neural net for quadratic assignment, Proceedings of the International Neural Network Conference — Paris, I, 282–6.

    Google Scholar 

  • Foo, Y.P.S. and Takefuji, Y. (1988a) Integer linear programming neural networks for job-shop scheduling, Proceedings of the International Conference on Neural Networks — San Diego, II, 341–8.

    Google Scholar 

  • Foo, Y.P.S. and Takefuji, Y. (1988b) Stochastic neural networks for solving job-shop scheduling: part 1. Problem Representation, Proceedings of the International Conference on Neural Networks — San Diego, II, 275–82.

    Google Scholar 

  • Foo, Y.P.S. and Takefuji, Y. (1988c) Stochastic neural networks for solving job-shop scheduling: part 2. Architecture and simulations, Proceedings of the International Conference on Neural Networks — San Diego, II, 283–90.

    Google Scholar 

  • Fort, J.C. (1988) Solving a combinatorial problem via self-organizing process; an application of the Kohonen algorithm to the TSP. Biological Cybernetics, 59, 33–40.

    Article  MathSciNet  MATH  Google Scholar 

  • French, S. (1982) Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, John Wiley & Sons.

    MATH  Google Scholar 

  • Fritzke, B. and Wilke, P. (1991) FLEXMAP — A neural networks for the traveling salesman problem with linear time and space complexity, Proceedings of the International Joint Conference on Neural Networks 91 — Singapore, I, 929–34.

    Google Scholar 

  • Fu Y. and Anderson, P.W. (1986) Applications of statistical mechanics to NP-complete problems in combinatorial optimization. Journal of Physics, 19, 1605–20.

    MathSciNet  MATH  Google Scholar 

  • Galar, R. (1989) Evolutionary search with soft selection. Biological Cybernetics, 60, 357–64.

    Article  MathSciNet  MATH  Google Scholar 

  • Geiger, D. and Yuille, A.L. (1989) A common framework for image segmentation, Harvard Robotics Laboratory, Technical Report, No. 89–7.

    Google Scholar 

  • Geman, S. and Geman, D. (1984) Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6, 721–41.

    Article  MATH  Google Scholar 

  • Goldstein, M. (1990) Self-organizing feature maps for the multiple traveling salesman problem (MTSP), Proceedings of the International Conference on Neural Network — Paris, I, 258–61.

    Google Scholar 

  • Goldstein, M., Toomarian, N. and Barhen, J. (1988) A comparison study of optimization methods for the bipartite matching problem (BMP), Proceedings of the International Conference on Neural Networks, II, 267–73.

    Article  Google Scholar 

  • Goles, E. and Vichniac, G.Y. (1986) Lyapunov functions for parallel neural networks, Neural Networks for Computing, AIP Conference Proceedings 151, (ed. J.S. Denker), 165–81.

    Google Scholar 

  • Grossberg, S. (1978) A theory of visual coding, memory, and development, in Formal Theories of Visual Perception, (eds E.L.J. Leeuwenberg and H.F.J.M. Buffart), John Wiley, New York.

    Google Scholar 

  • Gulati, S., Iyengar, S.S., Toomarian, N., Protopopescu, V. and Barhen, J. (1987) Nonlinear neural networks for deterministic scheduling, Proceedings of First International Conference Neural Networks — San Diego, IV, 745–52.

    Google Scholar 

  • Gutzmann, K.M. (1987) Combinatorial optimization using a continuous state Boltzmann machine, Proceedings of the International Conference on Neural Networks, III, 721–34.

    Google Scholar 

  • Hegde, S.U., Sweet, J.L. and Levy, W.B. (1988) Determination of parameters in a Hopfield/Tank computational network, Proceedings of the Second International Conference Neural Networks — San Diego, II, 291–8.

    Google Scholar 

  • Hertz, J., Krogh, A. and Palmer, R.G. (1991) Introduction to the Theory of Neural Computation, Addison-Wesley.

    Google Scholar 

  • Hinton, G.E., Sejnowski, T.J. and Ackley, D.H. (1984) Boltzmann machines: constraint satisfaction networks that learn, CMU technical report, CMU-CS-84-119.

    Google Scholar 

  • Hopfield, J.J. (1982) Neural networks and physical systems with emergent collective computational abilities, Proceedings of the National Academy of Science, 79, 2554–8.

    Article  MathSciNet  Google Scholar 

  • Hopfield, J.J. (1984) Neurons with graded response have collective computational properties like those of two-state neurons, Proceedings of the National Academy of Science, 81, 3088–92.

    Article  Google Scholar 

  • Hopfield, J.J. and Tank, D.W. (1985) Neural computation of decisions in optimization problems, Biological Cybernetics, 52, 141–52.

    MathSciNet  MATH  Google Scholar 

  • Huang, H.H., Zhang, C., Lee, S. and Wang, H.P. (1991) Implementation and comparison of neural network learning paradigms: Back propagation, simulated annealing and Tabu search, in Intelligent Engineering Systems through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), 95–100, ASME Press, New York.

    Google Scholar 

  • Hueter, G.J. (1988) Solution of the travelling salesman problem with an adaptive ring, Proceedings of the International Conference on Neural Networks — San Diego, I, 85–92.

    Article  Google Scholar 

  • Ivezic, N., Garrett Jr., J.H. and Ganeshan, R. (1991) Generalized Hopfield network for structural optimization, in Intelligent Engineering Systems Through Artificial Neural Networks (eds Dagli, Kumara, and Shin), 849–54, ASME Press, New York.

    Google Scholar 

  • Jeffrey, W. and Rosner, R. (1986) Optimization algorithms: Simulated annealing and neural network processing, Astrophysics Journal, 310, 473–81.

    Article  Google Scholar 

  • Jiang, J. (1991) IS: An intelligent scheduler for batch manufacturing systems, Computers Industrial Engineering, 21(1–4), 319–23.

    Article  Google Scholar 

  • Johnston, M.D. and Adorf, H.-M. (1989) A discrete stochastic neural network algorithm for constraint satisfaction problems, Proceedings of the NASA Conference on Space and Telerobotics — Pasadena, II, 367–76.

    Google Scholar 

  • Johnston, M.D. and Adorf, H.M. (1992) Scheduling with neural networks — the case of the Hubble space telescope, Computers Operation Research, 19(3/4), 209–40.

    Article  MATH  Google Scholar 

  • Joppe, A., Cardon, H.R.A. and Bioch, J.C. (1990) A neural network for solving the TSP on the basis of city adjacency in the tour, Proceedings of the International Conference on Neural Networks — Paris, I, 254–7.

    Google Scholar 

  • Kajiura, M., Akiyama, Y. and Anzai, Y. (1990) Solving large scale puzzles with neural networks, Proceedings of the Tools for AI Conference — Fairfax, II, 562–9.

    Google Scholar 

  • Kamgar-Parsi, B. and Kamgar-Parsi, B. (1987) An efficient model of neural networks for optimization, Proceedings of the First International Conference on Neural Networks — San Diego, III, 785–890.

    Google Scholar 

  • Kamgar-Parsi, B. and Kamgar-Parsi, B. (1990a) On problem solving with Hopfield neural networks, Biological Cybernetics, 62, 415–23.

    Article  MathSciNet  MATH  Google Scholar 

  • Kamgar-Parsi, B. and Kamgar-Parsi, B. (1990b) Clustering taxonomic data with neural networks, Proceedings of the International Neural Network Conference — Washington D.C., I, 277–80.

    Google Scholar 

  • Kasif, S. (1990) On the parallel complexity of discrete relaxation in constraint satisfaction networks, Journal of Artificial Intelligence, 45, 275–86.

    Article  MathSciNet  MATH  Google Scholar 

  • Kennedy, M.P. and Chua, L.O. (1988) Neural networks for nonlinear programming, I.E.E.E. Transactions on Circuits and Systems, 35.

    Google Scholar 

  • Kirkpatrick, S., Gelatt Jr., C.D. and Vecchi, M.P. (1983) Optimization by simulated annealing, Science, 220, 671–80.

    Article  MathSciNet  MATH  Google Scholar 

  • Kohonen, T. (1989) Self-Organization and Associative Memory, Springer, New York.

    Book  Google Scholar 

  • Kwon, T.M. and Lu, Y.Z. (1991) A comparative study of the traveling salesman problem, in Intelligent Engineering Systems Through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), pp. 889–94, ASME Press, New York.

    Google Scholar 

  • Lee, B.W. and Sheu, B.J. (1990) Combinatorial optimization using competitive—Hopfield neural networks, Proceedings of the International Joint Conference on Neural Networks — Washington D.C., II, 627–30.

    Google Scholar 

  • Lee, H.J. and Louri, A. (1991) Microcanonical mean field annealing: A new algorithm for increasing the convergence speed of mean field annealing, Proceedings of the International Joint Conference on Neural Networks 91 — Singapore, II, 941–6.

    Google Scholar 

  • Lee, H.-M. and Hsu, C.-C. (1990) Neural network processing through energy minimization with learning ability to the multiconstraint zero-one knapsack problem, Proceedings of the Tools for AI Conference — Fairfax, I, 548–55.

    Google Scholar 

  • Lee, K.C., Funabiki, N., Cho, Y.B. and Takefuji, Y. (1991) A parallel neural network computing for the maximum clique problem, Proceedings of the International Conference on Neural Networks — Singapore, II, 905–10.

    Google Scholar 

  • Levy, B.C. and Adams, M.B. (1987) Global optimization with stochastic neural networks, Proceedings of the International Conference on Neural Networks, III, 681–9.

    Google Scholar 

  • Lim, J-H. and Loe, K.F. (1991) Timetable scheduling using neural networks with parallel implementation on transputers, Proceedings of the International Joint Conference on Neural Networks — Singapore, I, 122–7.

    Google Scholar 

  • Lin, Jin-Ling, Foote, B., Chang, C.H. and Cheung, J.Y. (1991) A SMILE for packing and pallet loading in three dimensions, in Intelligent Engineering Systems Through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), pp. 763–73, ASME Press, New York.

    Google Scholar 

  • Looi, C.K. (1992) Neural network methods in combinatorial optimization, Computers Operation Research, 19(3/4), 191–208.

    Article  MATH  Google Scholar 

  • Lu, Y. and Thomborson, C.D. (1991) Gate array global routing using a neural network, in Intelligent Engineering Systems Through Artificial Neural Networks (eds Dagli, Kumara, and Shin), 895–900, ASME Press, New York.

    Google Scholar 

  • Matsuba, I. and Masui, H. (1991) Asymptotic behaviors of simulated annealing and mean-field approximate annealing, Proceedings of the International Joint Conference on Neural Networks — Singapore, 923–8.

    Google Scholar 

  • Matsuyama, Y. (1990) Competitive self-organization and combinatorial optimation: Applications to TSP, Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 819–24.

    Google Scholar 

  • McClelland, J.L. and Rumelhart, D.E. (1981) An interactive activation model of context effects in letter perception: Part 1. An account of basic findings, Psychological Review, 88, 375–407.

    Article  Google Scholar 

  • Mehra, P. and Wah, B.W. (1991) Learning load-balancing strategies using artificial neural networks, in Intelligent Engineering Systems Through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), 855–60, ASME Press, New York.

    Google Scholar 

  • Mehta, S. and Fulop, L. (1990) A neural algorithm to solve the graph matching problem, Proceedings of the International Conference on Neural Networks — Paris, I, 262–5.

    Google Scholar 

  • Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H. and Teller, E. (1953) Equations of state calculations by fast computing machines, Journal of Chemical Physics, 21(6), 1087–92.

    Article  Google Scholar 

  • Minton, S., Johnston, M.D., Philips, A.B. and Laird, P. (1990) A discrete stochastic neural network algorithm for constraint satisfaction problems, Proceedings of the Eighth National Conference on AI, 29, I, 17–24.

    Google Scholar 

  • Moopenn, A., Thakoor, A.P. and Duong, T. (1988) A neural network for euclidean distance minimization, Proceedings of the International Joint Conference on Neural Networks — San Diego, II, 349–56.

    Google Scholar 

  • Nemhauser, G.L. and Wolsey, L.A. (1988) Integer and Combinatorial Optimization, Wiley-Interscience, New York.

    MATH  Google Scholar 

  • Park, J.H. and Jeong, H. (1990) Solving the TSP using an effective Hopfield network, Proceedings of the International Joint Conference on Neural Networks — Paris I, 291–294.

    Google Scholar 

  • Peterson, C. (1990) Parallel distributed approaches to combinatorial optimization-Benchmark studies on TSP, LU TP 90–2, Department of Theoretical Physics, Lund, Sweden.

    Google Scholar 

  • Peterson, C. and Anderson, J. (1988) Neural networks and NP-complete optimization problems: A performance study on the graph bisection problem, Complex Systems, 2, 59–89.

    MathSciNet  MATH  Google Scholar 

  • Peterson, C. and Soderberg, B. (1989) A new method for mapping optimization problems onto neural networks, International Journal of Neural System, 1.

    Google Scholar 

  • Plant, J.C. and Barr, A.H. (1988) Constrained differential optimization, in Neural Information Processing Systems, American Institute of Physics, 612–21.

    Google Scholar 

  • Poliac, M.O., Lee, E.B., Slage, J.R. and Wick, M.R. (1987) A crew scheduling problem, Proceedings of the International Joint Conference on Neural Networks — San Diego, IV, 779–86.

    Google Scholar 

  • Potvin, J.Y., Shen, Y. and Rousseau, J.M (1992) Neural networks for automated vehicle dispatching, Computers Operation Research, 19(3/4), 267–76.

    Article  MATH  Google Scholar 

  • Ramanujam, J. and Sadayappan, P. (1988a) Optimization by neural networks, Proceedings of the International Conference on Neural Networks, II, 325–32.

    Article  Google Scholar 

  • Ramanujam, J. and Sadayappan, P. (1988b) Parameter identification for constrained optimization using neural networks, Proceedings of the Connectionist Summer School.

    Google Scholar 

  • Ranjithan, S., Garrett Jr., J.H. and Eheart, J.W. (1991) A feedback neural network approach to optimization: An application in groundwater remediation design, Intelligent Engineering Systems Through Artificial Neural Networks, (eds Dagli, Kumara, and Shin), 861–6, ASME Press, New York.

    Google Scholar 

  • Reggia, J. (1987) Properties in a competition-based activation mechanism in neuromimetic network models, in Proceedings of the International Conference on Neural Networks — San Diego, II, 131–8.

    Google Scholar 

  • Reklaitis, G.V., Tsirukis, A.G. and Tenorio, M.F. (1990) Generalized Hopfield networks and nonlinear optimization, Advances in Neural Information Processing Systems 2, (ed. D.S. Touretzky), Kaufmann.

    Google Scholar 

  • Rumelhart, D. E. and Zipser, D. (1985) Feature discovery by competitive learning, Cognitive Science, 9, 75–112.

    Article  Google Scholar 

  • Sasaki, M., Nakahara, Y., Gen, M. and Ida, K. (1991) An efficient algorithm for solving fuzzy multiobjective 0–1 Linear programming problem, Computers Industrial Engineering, 21(1–4), 647–51.

    Article  Google Scholar 

  • Simic, P. (1990) Statistical mechanics as the underlying theory of ‘elastic’ and ‘neural’ optimization, NETWORK: Computers and Neural Systems, I, 89–103.

    Article  MathSciNet  Google Scholar 

  • Steinberg, L. (1961) The backboard wiring problem: A placement algorithm, SIAM Review, 3, 37–50

    Article  MathSciNet  MATH  Google Scholar 

  • Szu, H. (1986) Fast simulated annealing, Proceedings of the AIP Conference on Neural Networks for Computing, 420–5.

    Google Scholar 

  • Szu, H. (1988) Fast TSP algorithm based on binary neuron otuput and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix, Proceedings of the International Joint Conference on Neural Networks — San Diego, II, 259–66.

    Google Scholar 

  • Tagliarini, G.A. and Page, E.W. (1987) Solving constraint satisfaction problems with neural network, Proceedings of the International Joint Conference on Neural Networks, III, 741–7.

    Google Scholar 

  • Tank, D.W. and Hopfield, J.J. (1986) Simple neural optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit, I.E.E.E. Transactions on Circuits and Systems, 33, 533–41.

    Article  Google Scholar 

  • Thomas, D.A. and Van den Bout, D.E. (1990) Encoding logical constraints into neural network cost functions, Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 863–8.

    Google Scholar 

  • Vaithyanathan, S. and Ignizio, J.P. (1992) A stochastic neural network for resource constrained scheduling, Computers Operation Research, 19(3/4), 241–54.

    Article  MATH  Google Scholar 

  • Van den Bout, D.E. and Miller, T.K. (1988) A travelling salesman objective function that works, Proceedings of the International Conference on Neural Networks, II, 259–66.

    Google Scholar 

  • Van den Bout, D.E. and Miller, T.K. (1989) Improving the performance of the Hopfield-Tank neural network through normalization and annealing, Biological Cybernetics, 62, 129–39.

    Article  Google Scholar 

  • Van den Bout, D.E. and Miller, T.K. (1990) Graph partitioning using annealed neural networks, I.E.E.E. Transactions on Neural Networks, 1, 192–203.

    Article  Google Scholar 

  • Wacholder, E., Han, J. and Mann, R.C. (1988) An extension of the Hopfield-Tank model for solution of the multiple TSP, Proceedings of the International Joint Conference on Neural Networks — San Diego, II, 305–24.

    Google Scholar 

  • Wacholder, E., Han, J. and Mann, R.C. (1988) A neural network algorithm for the multiple TSP, Biological Cybernetics, 61, 11–19.

    MathSciNet  Google Scholar 

  • Wang, J. (1990) A parallel distributed processor for the quadratic assignment problem, Proceedings of the International Conference on Neural Networks — Paris, I, 262–5.

    Google Scholar 

  • Wang, J. and V. Chankong (1992) Recurrent neural networks for linear programming: Analysis and design principles, Computers Operation Research, 19(3/4), 297–311.

    Article  MATH  Google Scholar 

  • Wilson, G.V. and Pawley, G.S. (1988) On the stability of the TSP algorithm of Hopfield and Tank, Biological Cybernetics, 58, 63–70.

    Article  MathSciNet  MATH  Google Scholar 

  • Wong, W.S. and Funka-Lea, C.A. (1990) An elastic net solution to obstacle avoidance tour planning, Proceedings of the International Joint Conference on Neural Networks — San Diego, Paris, III, 799–804.

    Google Scholar 

  • Xu, X. and Tsai, W.T. (1991) Effective neural algorithms for the TSP, Neural Networks, 4, 193–205.

    Article  Google Scholar 

  • Yih. , Y.W., Liang, T.P. and Moskowitz, H. (1991) A hybrid approach for crane scheduling problems, in Intelligent Engineering Systems Through Artificial Neural Networks (eds. Dagli, Kumara, and Shin), 867–72, ASME Press, New York.

    Google Scholar 

  • Yokai, H. and Kakazu, Y. (1991) An approach to traveling salesman problem by a bionic model, in Intelligent Engineering Systems Through Artificial Neural Networks, (eds, Dagli, Kumara, and Shin), 883–8, ASME Press, New York.

    Google Scholar 

  • Yue, T-W. and Fu, L-C. (1990) Ineffectiveness in solving combinatorial optimization problems using a Hopfield network: A new perspective from aliasing effect, Proceedings of the International Joint Conference on Neural Networks — San Diego, III.

    Google Scholar 

  • Yuille, A.L., Geiger, D. and Bulthoff, H.H. (1989) Stereo integration, mean field and psychophysics, Harvard Robotics Laboratory, Technical report, 10.

    Google Scholar 

  • Yuille, A.L. (1990) Generalized deformable models, statistical physics, and matching problems, Neural Computing, 2, 1–24.

    Article  Google Scholar 

  • Zhou, D.N., Cherkassy, V., Baldwin, T.R. and Hong, D.W. (1990) Scaling neural network for jobs-shop scheduling, Proceedings of the International Joint Conference on Neural Networks — San Diego, III, 889–94.

    Google Scholar 

  • Ziai, M.R. and Sule, D.R. (1991) Computerized facility layout design, Computers Industrial Engineering, 21(1–4), 385–9.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering & Computer Science, The University of Oklahoma, Norman, OK, 73019-0361, USA

    John Y. Cheung

Authors
  1. John Y. Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Engineering Management, University of Missouri-Rolla, USA

    Cihan H. Dagli (Associate Professor) (Associate Professor)

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Cheung, J.Y. (1994). Scheduling. In: Dagli, C.H. (eds) Artificial Neural Networks for Intelligent Manufacturing. Intelligent Manufacturing Series. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-0713-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-0713-6_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4307-6

  • Online ISBN: 978-94-011-0713-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation