Abstract
In this paper some results are summarized which were motivated by modeling the assembly of printed circuit boards using robots. First we consider an iterative traveling salesman — location model for sequencing the insertion points and locating the storage bins. The restricted location problem used in this model is generalized and some algorithms for solving this general problem are described. Finally, we discuss max-linear combinatorial optimization problems as models for multi objective problems.
Emphasis will be on results obtained by the author in cooperation with various collaborators. It is not intended to give a complete overview on the literature in this area.
Partially supported by NATO, Research Grant RG 85/0240 and grants of the Kultusministerium and the Ministerium für Wirtschaft und Verkehr, Rheinland-Pfalz, Germany.
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
Ball, M. O., and M. J. Magazine. Sequencing of insertions in PCB assembly. Operations Research, 36: 192–210, 1988.
Chung, S. J., H. W. Harnacher, F. Maffioli, and K. G. Murty. A note on combinatorial optimization problems with max-linear objective function. Accepted for Discrete Applied Mathematics, 1991.
Drezner, Z., and S. Y. Nof. On optimizing bin picking and insertion plans for assembly robots. IIE Transactions, 16: 262–270, 1984.
Foulds, L. R., and H. W. Harnacher. Optimal bin location and sequencing in printed circuit board assembly. Accepted for European Journal of Operations Research, published as Report No. 181, Department of Mathematics, University of Kaiserslautern, 1990.
Francis, R. L., and J. A. White. Facility layout and location: an analytical approach, Prentice-Hall 1974.
Francis, R. L., H. W. Hamacher, C.-Y. Lee, and S. Yeralan. On automating robotic assembly workplace planning. Submitted to IIE Transactions, published as Research Report 89–7, Department of Industrial and Systems Engineering, University of Florida, 1989.
Harnacher, H. W., and S. Nickel [ 1991 a]. Combinatorial algorithms for some 1-Facility median problems in the plane. Research Report No. 191, Department of Mathematics, University of Kaiserslautern, 1991.
Harnacher, H. W., and S. Nickel [ 1991 b]. Restricted facility location problems and applications. Research Report (in preparation), Department of Mathematics, University of Kaiserslautern, 1991.
Lawler, E. L., J. K. Lenstra, A. II. G. Rinnooy Kan, and D. B. Shmoys. The traveling salesman problem. John Wiley, 1986.
Lebrecht, U. Max-Lineare Zuordnungsprobleme in der Roboteroptimierung. Diploma Thesis, Department of Mathematics, University of Kaiserslautern, 1991.
Love, R. F., J. G. Morris, and G. O. Wesolowsky. Facilities location: models e methods. North-Holland, New York, 1988.
Nickel, S. Restriktive Standortprobleme. Diploma Thesis, Department of Mathematics, University of Kaiserslautern, 1991.
Righini, G., and A. Colorni. Max-linear combinatorial optimization. Technical Report, Dipartimento di Elettronica, Politecnico di Milano, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamacher, H.W. (1992). Combinatorial Optimization Models Motivated by Robotic Assembly Problems. In: Akgül, M., Hamacher, H.W., Tüfekçi, S. (eds) Combinatorial Optimization. NATO ASI Series, vol 82. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77489-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-77489-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77491-1
Online ISBN: 978-3-642-77489-8
eBook Packages: Springer Book Archive