An algorithm for optimising the servicing of products with constrained, multiple defects

International Journal of Production Research

Volumn 38, Issue 10, 2000, Pages 2185-2200

  Lye, S W ^a   Lee, S G ^a   Khoo, M K ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSEMBLY; COSTS; DEFECTS; OPTIMIZATION; WASTE MANAGEMENT;

MULTIPLE SERVICE ACTION (MSA) ALGORITHMS;

PRODUCTION ENGINEERING;

EID: 0034631283     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540050028043     Document Type: Article

References (22)

1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B., 1993, Network Flows - Theory, Algorithms, and Applications (Englewood Cliffs, NJ: Prentice Hall).
2. Bhatnagar, S.K., 1986, Network Analysis Techniques (New York: Wiley).
3. Billatos, S.B. and Nevrekar, V.V., 1994, Challenges and practical solutions to designing for the environment. Design for Manufacturability, 67, 49-64.
4. Carnegie Mellon University, 1991, Department of Social and Decision Sciences, Design Issues in Waste Management, Pittsburgh, PA.
5. Chen, W.K., 1990, Theory of Nets: Flows in Networks (New York: Wiley).
6. De Mello, H., Sanderson, L.S. and Arthur, C., 1991, A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Transactions on Robotics and Automation, 7, 228-240.
7. Environmental Protection Agency, 1993, Status report on the use of environmental waste, EPA 742-R-9-93-001, Washington DC.
8. Evans, J.R. and Minieka, E., 1992, Optimisation Algorithms for Networks and Graphs (New York: Marcel Dekker).
9. Fiksel, J.R., 1996, Design for Environment: Creating Eco-efficient Products and Processes (New York: McGraw-Hill).
10. Gallo, G. and Pallottino, S., 1986, Shortest path methods: a unifying approach. Mathematical Programming Study, 26, 38-64.
11. Ishii, K., Eubanks, C.F. and Marks, M., 1993, Evaluation methodology for post manufacturing issues in life cycle design. Concurrent Engineering: Research and Applications, 1, 61-68.
12. Laperriere, L. and Elmaraghy, H.A., 1992, Planning of products assembly and disassembly. Annals of the CIRP, 4, 5-9.
13. McHugh, J.A., 1990, Algorithmic Graph Theory (Englewood Cliffs, NJ: Prentice-Hall).
14. Meltser, M. and Zussman, E., 1997, Planning and re-planning strategy of disassembly processes. Proceedings of the 4th CIRP International Seminar on Life Cycle Engineering, pp. 423-432.
15. Philips, D.T. and Garcia-Diaz, A., 1981, Fundamentals of Network Analysis (Englewood Cliffs, NJ: Prentice Hall).
16. Tarjan, R.E., 1986, Algorithms for maximum network flow. Mathematical Programming Study, 26, 1-11.
17. Ziilch, G., Schiller, E.F. and Muller, R., 1997, A disassembly information system. Proceedings of the 4th CIRP International Seminar on Life Cycle Engineering, pp. 400-412.
18. Zussman, E., Kriwet, A. and Seliger, G., 1994, Disassembly-oriented assessment methodology to support design for recycling. Annals of the CIRP, 43, 9-14.
19. Zussman, E, Scholz-Reiter, B. and Scharke, H., 1995, Modeling and planning of disassembly processes. International Conference on Life-Cycle Modeling for Innovative Products and Processes, pp. 221-232. Design Analysis of Algorithms, http://www.ics.uci.edu/̃eppstein/161/960208.html. Shortest Path Algorithm, http://www.csi.uottawa.ca/̃holte/T26/shortest-path.html. Shortest Path Algorithms, http://www.qpsf.edu.au/mirrors/dbpp/test/node35.html.
20. Zussman, E, Scholz-Reiter, B. and Scharke, H., 1995, Modeling and planning of disassembly processes. International Conference on Life-Cycle Modeling for Innovative Products and Processes, pp. 221-232. Design Analysis of Algorithms, http://www.ics.uci.edu/̃eppstein/161/960208.html. Shortest Path Algorithm, http://www.csi.uottawa.ca/̃holte/T26/shortest-path.html. Shortest Path Algorithms, http://www.qpsf.edu.au/mirrors/dbpp/test/node35.html.
21. Zussman, E, Scholz-Reiter, B. and Scharke, H., 1995, Modeling and planning of disassembly processes. International Conference on Life-Cycle Modeling for Innovative Products and Processes, pp. 221-232. Design Analysis of Algorithms, http://www.ics.uci.edu/̃eppstein/161/960208.html. Shortest Path Algorithm, http://www.csi.uottawa.ca/̃holte/T26/shortest-path.html. Shortest Path Algorithms, http://www.qpsf.edu.au/mirrors/dbpp/test/node35.html.
22. Zussman, E, Scholz-Reiter, B. and Scharke, H., 1995, Modeling and planning of disassembly processes. International Conference on Life-Cycle Modeling for Innovative Products and Processes, pp. 221-232. Design Analysis of Algorithms, http://www.ics.uci.edu/̃eppstein/161/960208.html. Shortest Path Algorithm, http://www.csi.uottawa.ca/̃holte/T26/shortest-path.html. Shortest Path Algorithms, http://www.qpsf.edu.au/mirrors/dbpp/test/node35.html.