Lagrangian relaxation neural networks for job shop scheduling

IEEE Transactions on Robotics and Automation

Volumn 16, Issue 1, 2000, Pages 78-88

  Luh, Peter B ^a,b   Zhao, Xing ^c   Wang, Yajun ^d   Thakur, Lakshman S ^e  

^a IEEE

^b UNIVERSITY OF CONNECTICUT   (United States)

^c i2 Technologies   (United States)

^d Univerity of Connecticut ^*  (United States)

^e UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; INTEGER PROGRAMMING; PRODUCTION CONTROL; RECURRENT NEURAL NETWORKS; RELAXATION PROCESSES;

JOB SHOP SCHEDULING; LAGRANGIAN RELAXATION NEURAL NETWORKS (LRNN);

FACTORY AUTOMATION;

EID: 0033892592     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.833193     Document Type: Article

References (21)

1. K. J. Arrow, L. Hurwitz, and H. Uzawa, Studies in Linear and Nonlinear Programming. Stanford, CA: Stanford Univ. Press, 1958, pp. 133-145.
2. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1995, pp. 418-449, pp. 507-508.
3. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming. Belmont, MA: Athena Scientific, 1996.
4. R. Dorfman, P. A. Samuelson, and R. Solow, Linear Programming and Economic Analysis. New York: McGraw-Hill, 1958, p. 63.
5. Y. P. S. Foo and Y. Takefuji, "Stochastic neural networks for solving job-shop scheduling," in Proc. IEEE 2nd Int. Conf. Neural Networks, 1988, pp. 275-290.
6. Y. P. S. Foo and Y. Takefuji, "Integer-linear programming neural networks for job-shop scheduling," in Proc. IEEE 2nd Int. Conf. Neural Networks, 1988, pp. 341-348.
7. D. J. Hoitomt, P. B. Luh, and K. R. Pattipati, "A practical approach to job shop scheduling problems," IEEE Trans. Robot. Automat., vol. 9, pp. I-13, Feb. 1993.
8. J. J. Hopfield and D. W. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
9. C. A. Kaskavelis and M. C. Caramanis, "Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems," IIE Trans., vol. 30, no. 11, pp. 1085-1097, Nov. 1998.
10. Z. Li, "Improving convergence and solution quality of hopfield-type neural networks with augmented Lagrange multipliers," IEEE Trans. Neural Networks, vol. 7, pp. 1507-1516, Nov. 1996.
11. P. B. Luh, X. Zhao, L. S. Thakur, K. H. Chen, T. D. Chieu, and S. C. Chang, "Architectural design of neural network hardware for job shop scheduling," CIRP Annals, vol. 48, no. 1, pp. 373-376, Aug. 1999.
12. G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988, p. 325.
13. M. Pinedo, Scheduling - Theory, Algorithm and Systems. Englewood Cliffs, NJ: Prentice-Hall, 1995, p. 128.
14. Sabuncuoglu and B. Gurgun, "A neural network model for scheduling problems," Eur. J. Operational Res., vol. 9, no. 2, pp. 288-299, Sept. 1996.
15. K. Satake, K. Morikawa, and N. Nakamura, "Neural network approach for minimizing the makespan of the general job-shop," Int. J. Production Economics, vol. 33, no. 1, pp. 67-74, Jan. 1994.
16. E. Wacholder, J. Han, and R. C. Mann, "A neural network algorithm for the multiple traveling salesmen problem," Biol. Cybern., vol. 61, pp. 11-19, 1989.
17. J. Wang, P. B. Luh, X. Zhao, and J. Wang, "An optimization-based algorithm for job shop scheduling," SADHANA, pt. 2, vol. 22, pp. 241-256, Apr. 1997.
18. T. M. Willems and L. E. M. W. Brandts, "Implementing heuristics as an optimization criterion in neural networks for job-shop scheduling," J. Intell. Manufacturing, vol. 6, no. 6, pp. 377-387, Dec. 1995.
19. V. Wilson and G. S. Pawley, "On the stability of the traveling salesman problem algorithm of hopfield and tank," Biol. Cybern., vol. 58, pp. 63-70, 1988.
20. D. N. Zhou, V. Cherkassky, T. R. Baldwin, and D. E. Olson, "A neural network approach to job-shop scheduling," IEEE Trans. Neural Networks, vol. 2, pp. 175-179, Jan. 1991.
21. X. Zhao, P. B. Luh, and J. Wang, "Surrogate gradient algorithm for Lagrangian relaxation," J. Optimization Theory and Applications, vol. 100, no. 3, pp. 699-712, Mar. 1999.