Applications of neural networks to solving SMT scheduling problems a case study

International Journal of Production Research

Volumn 37, Issue 17, 1999, Pages 4007-4020

  Chen, M ^a   Dong, Y ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; NEURAL NETWORKS; NONLINEAR PROGRAMMING; PRINTED CIRCUIT BOARDS; PROBLEM SOLVING; PRODUCTION ENGINEERING; PRODUCTIVITY; SCHEDULING;

ASSEMBLY LINE; JOB SEQUENCE; PRODUCTION SCHEDULING; SYSTEM SETUP COST;

SURFACE MOUNT TECHNOLOGY;

EID: 0033224891     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499189899     Document Type: Article

References (31)

1. Burkard, R. E., Deineko, V. G., Van Dal, R., vander Veen, J. A. A. and Woeginger, G. J., 1998, Well-solvable special cases of the traveling salesman problem: a survey. SIAM Review, 40, 496-546.
2. Carmon, T F., Maimon, O. Z. and Dar-El, E. M., 1989, Group set-up for printed circuit board assembly. International Journal of Production Research, 27, 1837-1841.
3. Chua, L. O. and Lin, G. N., 1984, Nonlinear programming without computation. IEEE Transactions on Circuits and Systems, 31, 182-188.
4. Dessouky, M. M., Adiga, S. and Park, K., 1995, Design and scheduling of flexible assembly lines for printed circuit boards. International Journal of Production Research, 33, 757 775.
5. Fathi, Y. and Taheri, J., 1989, A mathematical model for loading the sequencers in a printed circuit pack manufacturing environment. International Journal of Production Research, 27, 1305-1316.
6. Gendreau, M., Laporte, G. and Semet, F., 1998, A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research, 106, 539-545.
7. Glover, F. and Punnen, A. P., 1997, The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms. Journal of the Operational Research Society, 48, 502-510.
8. Hao, G., Shang, J. S. and Vargas, L. G., 1995, A neural network model for on-line control of flexible manufacturing systems. International Journal of Production Research, 33, 2835-2854.
9. Hashiba, S. and Chang, T. C., 1991, PCB assembly setup reduction using group technology. Computers and Industrial Engineering, 21, 453-457.
10. Hinch, S. W., 1988, Handbook of Surface Mount Technology (Harlow, UK: Longman Scientific and Technical).
11. Ji, P., Wong, Y. S., Loh, H. T and Lee, L. C., 1994, SMT production scheduling: A general ized transportation approach. International Journal of Production Research, 32, 2323 2334.
12. Johri, P K, 1991, Engineering a circuit board assembly line for a desired capacity and flowtime. Journal of Manufacturing System, 10, 492-500.
13. Kennedy, M. P. and Chua, L. O., 1988, Neural networks for nonlinear programming. IEEE Transactions on Circuits and Systems, 35, 554-562.
14. Kim, S. C. and Bobrowski, P. M., 1994, Impact of sequence-dependent setup time on job shop scheduling performance. International Journal of Production Research, 32, 1503 1520.
15. Laporte, G., Asef-Faziri, A. and Sriskandrarajah, C., 1996, Some applications of the generalized travelling salesman problem. Journal of the Operational Research Society, 47, 1461-1467.
16. Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R. and Shmoys, D. B. (eds), 1985, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Chichester: Wiley).
17. McKay, K. N., Safayeni, F. R. and Buzacott, J. A., 1995, ‘Common sense’ realities of planning and scheduling in printed circuit board production. International Journal of Production Research, 33, 1587-1603.
18. Nemhauser, G. L. and Wolsey, L. A., 1988, Integer and Combinatorial Optimization (New York: Wiley).
19. Randhawa, S. U. and Smith, T. A., 1995, An experimental investigation of scheduling non identical, parallel processors with sequence-dependent set-up times and due dates. International Journal of Production Research, 33, 59-69.
20. Roychoudhury, B. and Muth, J. F., 1995, The solution of travelling salesman problems base on industrial data. Journal of the Operational Research Society, 46, 347-353.
21. Sadiq, M., Landers, T. L. and Taylor, G. D., 1993, A heuristic algorithm for minimizing total production time for a sequence of jobs on a surface mount placement machine. International Journal of Production Research, 31, 1327-1342.
22. Salomon, M., Solomon, M. M., VanVassenhove, L. N., Dumas, Y. and Dauzere-Peres, S., 1997, Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research, 100, 494-513.
23. Sule, D. R., 1992, A heuristic procedure for component scheduling in printed circuit pack sequencers. International Journal of Production Research, 30, 1191-1208.
24. Takahashi, Y., 1997, Mathematical improvement of the hopheld model for TSP feasible solutions by synapse dynamical systems. Neurocomputing, 15, 15-43.
25. Tank, D. W. and Hopfield, J. J., 1986, Simple ‘neural’ optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit. IEEE Transactions on Circuits and Systems, 33, 533-541.
26. van deb Veen, J. A., Woeginger, G. J. and Zhang, S., 1998, Sequencing jobs that require common resources on a single machine: a solvable case of the TSP. Mathematical Programming, 82, 235-254.
27. Xia, Y., 1996, A new neural network for solving linear programming problems and its appli cation. IEEE Transactions on Neural Networks, 7, 525-529.
28. Xia, Y. and Wang, J., 1995, Neural network for solving linear programming problems with bounded variables. IEEE Transactions on Neural Networks, 6, 515-519.
29. 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, 705-728.
30. 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, 175-179.
31. Zolfaghari, S. and Liang, M., 1997, An objective-guided ortho-synapse Hopheld network approach to machine grouping problems. International Journal of Production Research, 35, 2773-2792.