IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v17y1970i3p161-169.html
   My bibliography  Save this article

Modular Allocation Technique (MAT)

Author

Listed:
  • Harry K. Edwards

    (University of Missouri, Rolla)

  • Billy E. Gillett

    (University of Missouri, Rolla)

  • Monta E. Hale

    (Allison Division, General Motors Corporation, Indianapolis, Indiana)

Abstract

The major problem in "layout" is to determine the most economical relative location of facilities. MAT is a construction technique utilizing the distances between all pairs of locations and the loads transported between all pairs of facilities per unit time to approximate the optimal allocation of the facilities to the locations. The MAT general algorithm, an example problem and a theorem relating the MAT solution to the optimal solution are given. A computer program has been written that will apply MAT to the allocation problem for a maximum of 40 facilities.

Suggested Citation

  • Harry K. Edwards & Billy E. Gillett & Monta E. Hale, 1970. "Modular Allocation Technique (MAT)," Management Science, INFORMS, vol. 17(3), pages 161-169, November.
    • Handle: RePEc:inm:ormnsc:v:17:y:1970:i:3:p:161-169
    DOI: 10.1287/mnsc.17.3.161
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.17.3.161
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.17.3.161?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    2. Robin S Liggett, 1980. "The Quadratic Assignment Problem: An Analysis of Applications and Solution Strategies," Environment and Planning B, , vol. 7(2), pages 141-162, June.
    3. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    4. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ormnsc:v:17:y:1970:i:3:p:161-169. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.