IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v138y2005i1p223-23310.1007-s10479-005-2455-0.html
   My bibliography  Save this article

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

Author

Listed:
  • George Polak

Abstract

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. Copyright Springer Science + Business Media, Inc. 2005

Suggested Citation

  • George Polak, 2005. "On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices," Annals of Operations Research, Springer, vol. 138(1), pages 223-233, September.
    • Handle: RePEc:spr:annopr:v:138:y:2005:i:1:p:223-233:10.1007/s10479-005-2455-0
    DOI: 10.1007/s10479-005-2455-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-005-2455-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-005-2455-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pitsoulis, Leonidas S. & Pardalos, Panos M. & Hearn, Donald W., 2001. "Approximate solutions to the turbine balancing problem," European Journal of Operational Research, Elsevier, vol. 130(1), pages 147-155, April.
    2. Saifallah Benjaafar, 2002. "Modeling and Analysis of Congestion in the Design of Facility Layouts," Management Science, INFORMS, vol. 48(5), pages 679-704, May.
    3. Vickson, R. G. & Lu, Xinjian, 1998. "Optimal product and server locations in one-dimensional storage racks," European Journal of Operational Research, Elsevier, vol. 105(1), pages 18-28, February.
    4. Leipala, Timo & Nevalainen, Olli, 1989. "Optimization of the movements of a component placement machine," European Journal of Operational Research, Elsevier, vol. 38(2), pages 167-177, January.
    5. Crama, Yves, 1997. "Combinatorial optimization models for production scheduling in automated manufacturing systems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 136-153, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Buchheim, Christoph & Crama, Yves & Rodríguez-Heck, Elisabeth, 2019. "Berge-acyclic multilinear 0–1 optimization problems," European Journal of Operational Research, Elsevier, vol. 273(1), pages 102-107.
    3. Yves Crama & Joris van de Klundert, 1999. "Worst‐case performance of approximation algorithms for tool management problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(5), pages 445-462, August.
    4. Cavory, G. & Dupas, R. & Goncalves, G., 2005. "A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints," European Journal of Operational Research, Elsevier, vol. 161(1), pages 73-85, February.
    5. Paul, Henrik J. & Bierwirth, Christian & Kopfer, Herbert, 2007. "A heuristic scheduling procedure for multi-item hoist production lines," International Journal of Production Economics, Elsevier, vol. 105(1), pages 54-69, January.
    6. Chiang, Wen-Chyuan & Kouvelis, Panagiotis & Urban, Timothy L., 2006. "Single- and multi-objective facility layout with workflow interference considerations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1414-1426, November.
    7. Kuldeep Lamba & Ravi Kumar & Shraddha Mishra & Shubhangini Rajput, 2020. "Sustainable dynamic cellular facility layout: a solution approach using simulated annealing-based meta-heuristic," Annals of Operations Research, Springer, vol. 290(1), pages 5-26, July.
    8. E Duman, 2007. "Modelling the operations of a component placement machine with rotational turret and stationary component magazine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 317-325, March.
    9. Matzliach, Barouch & Tzur, Michal, 2000. "Storage management of items in two levels of availability," European Journal of Operational Research, Elsevier, vol. 121(2), pages 363-379, March.
    10. Cochran, Jeffery K. & Marquez Uribe, Alberto, 2005. "A set covering formulation for agile capacity planning within supply chains," International Journal of Production Economics, Elsevier, vol. 95(2), pages 139-149, February.
    11. M. Selim Akturk & Jay B. Ghosh & Evrim D. Gunes, 2003. "Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 15-30, February.
    12. Soukhal, A. & Martineau, P., 2005. "Resolution of a scheduling problem in a flowshop robotic cell," European Journal of Operational Research, Elsevier, vol. 161(1), pages 62-72, February.
    13. Drobouchevitch, Inna G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 2006. "Scheduling dual gripper robotic cell: One-unit cycles," European Journal of Operational Research, Elsevier, vol. 171(2), pages 598-631, June.
    14. Pazour, Jennifer A. & Meller, Russell D., 2013. "The impact of batch retrievals on throughput performance of a carousel system serviced by a storage and retrieval machine," International Journal of Production Economics, Elsevier, vol. 142(2), pages 332-342.
    15. Asef-Vaziri, Ardavan & Kazemi, Morteza, 2018. "Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1033-1044.
    16. Konak, Abdullah & Kulturel-Konak, Sadan & Azizoglu, Meral, 2008. "Minimizing the number of tool switching instants in Flexible Manufacturing Systems," International Journal of Production Economics, Elsevier, vol. 116(2), pages 298-307, December.
    17. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
    18. Chelliah Sriskandarajah & Inna Drobouchevitch & Suresh P. Sethi & Ramaswamy Chandrasekaran, 2004. "Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot," Operations Research, INFORMS, vol. 52(1), pages 65-82, February.
    19. T Knuutila & S Pyöttiälä & O S Nevalainen, 2007. "Minimizing the number of pickups on a multi-head placement machine," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 115-121, January.
    20. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:138:y:2005:i:1:p:223-233:10.1007/s10479-005-2455-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.