Scheduling multiprocessor job with resource and timing constraints using neural networks

@article{Huang1999SchedulingMJ,
  title={Scheduling multiprocessor job with resource and timing constraints using neural networks},
  author={Yueh-Min Huang and Ruey-Maw Chen},
  journal={IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society},
  year={1999},
  volume={29 4},
  pages={490-502}
}
The Hopfield neural network is extensively applied to obtaining an optimal/feasible solution in many different applications such as the traveling salesman problem (TSP), a typical discrete combinatorial problem. Although providing rapid convergence to the solution, TSP frequently converges to a local minimum. Stochastic simulated annealing is a highly effective means of obtaining an optimal solution capable of preventing the local minimum. This important feature is embedded into a Hopfield… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Anytime scheduling with neural networks

  • J. M. Gallone, F. Charpillet, F. Alexandre
  • inProc. 1995 INRIA/IEEE Symp. Emerging…
  • 1995
1 Excerpt

Experimental study of a neural model for scheduling job shops

  • C. Y. Chang, M. D. Jeng
  • inIEEE Int. Conf. Systems, Man, Cybernetics, 1995…
  • 1995
1 Excerpt

Near optimal jobshop scheduling using neural network parallel computing

  • A. Hanada, K. Ohnishi
  • Proc. IECON’93, Int. Conf. Industrial Electronics…
  • 1993
1 Excerpt

Solving job-shop scheduling problem with priority using neural network

  • C.-S. Zhang, P.-F. Yan, T. Chang
  • IEEE Int. Conf. Neural Networks,1991, pp. 1361…
  • 1991
1 Excerpt

Improving the performance of Hopfield–Tank neural network through normalization and annealing

  • D. Geman
  • Biol. Cybern.,vol. 62, pp. 129–139, 1989.
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…