Abstract
A competitive neural network provides a highly effective means of attaining a sound solution and of reducing the network complexity. A competitive approach is utilized to deal with fully-utilized scheduling problems. This investigation employs slack competitive Hopfield neural network (SCHNN) to resolve non-fully and fully utilized identical machine scheduling problems with multi-constraint, real time (execution time and deadline constraints) and resource constraints. To facilitate resolving the scheduling problems, extra slack neurons are added on to the neural networks to represent pseudo-jobs. This study presents an energy function corresponding to a neural network containing slack neurons. Simulation results demonstrate that the proposed energy function integrating competitive neural network with slack neurons can solve fully and non-fully utilized real-time scheduling problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Willems, T.M., Rooda, J.E.: Neural Networks for Job-shop Scheduling. Control Eng. Practice 2(1), 31–39 (1994)
Foo, Y.P.S., Takefuji, Y.: Integer linear programming neural networks for job-shop scheduling. In: IEEE Int. Conf. on Neural Networks, vol. 2, pp. 341–348 (1998)
Zhang, C.S., Yan, P.F., Chang, T.: Solving Job-Shop Scheduling Problem with Priority Using Neural Network. In: IEEE Int. Conf. on Neural Networks, pp. 1361–1366. IEEE Computer Society Press, Los Alamitos (1991)
Silva, M.P., Cardeira, C., Mammeri, Z.: Solving real-time scheduling problems with Hopfield-type neural networks. In: EUROMICRO 97 New Frontiers of Information Technology, Proceedings of the 23rd EUROMICRO Conference, pp. 671–678, 1–4 (1997)
Hanada, A., Ohnishi, K.: Near optimal jobshop scheduling using neural network parallel computing. In: Int. Conf. on Proc.Industrial Electronics, Control, and Instrumentation, vol. 1, pp. 315–320 (1993)
Park, J.G., Park, J.M., Kim, D.S., Lee, C.H., Suh, S.W., Han, M.S.: Dynamic neural network with heuristic. In: IEEE Int. Conf. on Neural Networks, vol. 7, pp. 4650–4654 (1994)
Hopfield, J.J., Tank, D.W.: Neural computation of ecision in optimization problems. Biological Cybernetics 52, 141–152 (1985)
Dixon, M.W., Cole, G.R., Bellgard, M.I.: Using the Hopfield network with mean field annealing to solve the shortest path problem in a communication network. In: Int. Conf. on Neural Networks, vol. 5, pp. 2652–2657 (1995)
Huang, Y., Chen, R.M.: Scheduling multiprocessor job with resource and timing constraints using neural network. IEEE Trans. on System, Man and Cybernetics, part B 29(4), 490–502 (1999)
Watanable, Y., Mizuguchi, N., Fujii, Y.: Solving optimization problems by using a Hopfield neural network and genetic algorithms combination, System Computation, Japan, vol. 29(10), pp. 68–73 (1988)
Sancho, S.S., Carlos, B.C., Anibal, R.: Figueiras-Vidal. A mixed Neural-Genetic Algorithm for the Broadcast Scheduling Problem. IEEE Trans. on Wireless Communication 2(2), 277–283 (2003)
Cheng, S.C., Huang, Y.M.: Scheduling Multi-Processor Tasks with Resource and Timing Constraints Using Genetic Algorithm. In: Chung, P. C., Tsai, C. T., Chen, E. L., Sun, Y. N. The 5th IEEE International Symposium on Computational Intelligence in Robotics and Automation (2003), [13] pp. 624–629. Polygonal approximation using a competitive Hopfield neural network, Pattern Recognition, vol. 27, pp. 1505–1512 (1994)
Uchiyama, T., Arbib, M.: Color Image Segmentation Using Competitive Learning. IEEE Trans. Pattern Analysis Machine Intelligence 16(12), 1197–1206 (1994)
Chen, R., Huang, Y.M.: Competitive Neural Network to Solve Scheduling Problem. Neurocomputing 37, 177–196 (2001)
Cardeira, C., Mammeri, Z.: Neural networks for multiprocessor real-time scheduling, In: IEEE Proc. 6th Euromicro Workshop on Real-Time Sys. pp. 59–64 (1994)
Cardeira, C., Mammeri, Z.: Handling Precedence Constraints with Neural Network Based Real-time Scheduling Algorithms. In: Proceedings of Ninth Euromicro Workshop on Real-Time Systems, pp. 207–214 (1997)
Tagliarini, G.A., Christ, J.F., Page, E.W.: Optimization Using Neural Networks. IEEE Transaction on Computers 40(12), 1347–1358 (1991)
Hopfield, J., Tank, D.W.: Computing with neural circuits: A model, Science 233, 625–633 (1986)
Lee, K.C., Funabiki, N., Takefuji, Y.: A parallel improvement algorithm for the bipartite subgraph problem Neural Networks. IEEE Transactions 3(1), 139–145 (1992)
Takeda, M.J., Goodman, W.: Neural networks for computation: number representation and programming complexity. Applied Optics 25, 3033–3046 (1986)
Cohen, M., Grossberg, S.: Absolute stability of goal pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. On System, Man, and Cybernetics 13, 815–826 (1983)
Takefuji, Y., Lee, K.: An artificial hystersis binary neuron: a model suppressing the oscillatory behaviors of neuron dynamics. Biological Cybernetics 64, 353–356 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Chen, RM., Lo, ST., Huang, YM. (2007). Solving Inequality Constraints Job Scheduling Problem by Slack Competitive Neural Scheme. In: Okuno, H.G., Ali, M. (eds) New Trends in Applied Artificial Intelligence. IEA/AIE 2007. Lecture Notes in Computer Science(), vol 4570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73325-6_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-73325-6_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73322-5
Online ISBN: 978-3-540-73325-6
eBook Packages: Computer ScienceComputer Science (R0)