Annals of Operations Research

, Volume 138, Issue 1, pp 223–233 | Cite as

On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices

  • George G. Polak


In a storage-and-retrieval device, items are retrieved on demand from a storage bank by a picking mechanism. Many varieties of these robotic devices are in use in manufacturing, logistics and computer peripherals. In printed circuit board manufacturing, storage-and-retrieval is intertwined with component placement and product clustering. Under certain circumstances, the problem of assigning items by type to storage slots to minimize the expected retrieval time is a quadratic assignment problem. Although such models are very difficult to solve to optimality, an important special case considered here admits an easy solution, namely, the well known “organ pipe” arrangement of items.


quadratic assignment problem storage-and-retrieval 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ball, M.O. and M.J. Magazine. (1988). “Sequencing of Insertions in Printed Circuit Board Assembly.” Operations Research 36(2), 192–201.CrossRefGoogle Scholar
  2. Barvinok, A. and T. Stephen. (2003). “The Distribution of Values in the Quadratic Assignment Problem.” Mathematics of Operations Research 28(1), 64–91.CrossRefGoogle Scholar
  3. Benjaafar, S. (2002). “Modeling and Analysis of Congestion in the Design of Facility Layouts.” Management Science 48(5), 679–704.CrossRefGoogle Scholar
  4. Burkard, R.E., E.D. Çela, V.M. Demidenko, N.N. Metelski, and G.J. Woeginger. (1997). “Perspectives of Easy and Hard Cases of The Quadratic Assignment Problem.” SFB Report 104, Institute of Mathematics, Technical University Graz.Google Scholar
  5. Burkard, R.E., E.D. Çela, P.M. Pardalos, and L.S. Pitsoulis. (1999). “The Quadratic Assignment Problem.” In P.M. Pardalos and D.-Z. Du, (eds.), Handbook of Combinatorial Optimization. Kluwer Academic Publishers, pp. 241–338.Google Scholar
  6. Cohn, A.M., M.J. Magazine, and G.G. Polak. (2000). “Integrating Printed Circuit Board Manufacturing Problems by Branch-and-Price.” Massachusetts Institute of Technology Operations Research Center Report OR 00–349, Cambridge, MA.Google Scholar
  7. Crama, Y. (1997). “Combinatorial Optimization models for Production Scheduling in Automated Manufacturing Systems.” European Journal of Operational Research 99, 136–153.CrossRefGoogle Scholar
  8. Crama, Y., J. van de Klundert, and F.C.R. Spieksma. (1999). “Production Planning Problems in Printed Circuit Board Assembly.” GEMME 9925, University of Liege, Liege, Belgium.Google Scholar
  9. Grotzinger, S. (1992). “Feeder Assignment Models for Concurrent Placement Machines.” IIE Transactions 24(4), 31–46.Google Scholar
  10. Hardy, G., J. Littlewood, and G. Polya. (1952). Inequalities, 2nd edn., Oxford University Press.Google Scholar
  11. Hop, N.V. and M.T. Tabucanon. (2001), “Multiple Criteria Approach for Solving Feeder Assignment and Assembly Sequence Problem in PCB Assembly.” Production Planning and Control 12(8), 736–744.CrossRefGoogle Scholar
  12. Johnson, M.E. (1995). “Hewlett-Packard: Spokane Surface Mount Center.” In Proc. of Decision Sciences, Boston, Nov., pp. 139–141.Google Scholar
  13. Leipälä, T. and O. Nevalainen. (1989). “Optimization of the Movements of a Component Placement Machine.” European Journal of Operational Research 38, 167–177.CrossRefGoogle Scholar
  14. Magazine, M.J. and G.G. Polak. (2003). “Job Release Policy and Printed Circuit Board Assembly.” IIE Transactions 35(4), 379–387.CrossRefGoogle Scholar
  15. Mak, R., K. Lam, and S.M. Gupta. (1998). “A Practical Algorithm for Cyclic Hoist Scheduling in a PCB Manufacturing Facility.” Journal of Electronics Manufacturing 8(3A), 193–207.CrossRefGoogle Scholar
  16. Moyer, L.K. and S.M. Gupta. (1996). “Simultaneous Component Sequencing and Feeder Assignment for High Speed Chip Shooter Machines.” Journal of Electronics Manufacturing 6(4), 271–305.CrossRefGoogle Scholar
  17. Pitsoulis, L.S., P.M Pardalos, and D.W. Hearn. (2001). “Approximate Solutions to the Turbine Balancing Problem.” European Journal of Operational Research 130(1), 147–155.CrossRefGoogle Scholar
  18. Polak, G.G. (2002). “A Special Case of the Quadratic Assignment Model with an Application to Storage-and-Retrieval Devices.” In Proceedings of the Eleventh Latin-Iberian American Congress of Operations Research (IX CLAIO). University of Concepción. Chile, 27–31 October, 2002.Google Scholar
  19. Polak, G.G. (2003). “From Organ Pipes to Pointers: Two Problems of Combinatorial Optimization in Printed Circuit Board Assembly.” Seminar presentation notes, Department of Industrial and Systems Engineering, University of Michigan, Ann Arbor, MI, USA 48109.Google Scholar
  20. Resnick, S.I. (1992). Adventures in Stochastic Processes. Boston, MA: Birkhauser.Google Scholar
  21. Seshadri, S., D. Rotem, and A. Segev. (1994). “Optimal Arrangements of Cartridges in Carousel Type Mass Storage Systems.” The Computer Journal 37(10), 873–887.CrossRefGoogle Scholar
  22. Vickson, R.G. (2002). Personal Communication with Author.Google Scholar
  23. Vickson, R.G. and X. Lu. (1998). “Optimal Product and Server Locations in One-Dimensional Storage Racks.” European Journal of Operational Research 105, 18–28.CrossRefGoogle Scholar
  24. Wong, C.K. (1980). “Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage Systems.” Computing Surveys 12(2), 167–178.CrossRefGoogle Scholar
  25. Wong, C.K. (1983). Algorithmic Studies in Mass Storage Systems. Computer Science Press, Rockville, MD.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.ISOM Department, Raj Soin College of BusinessWright State UniversityDayton

Personalised recommendations