Advanced Search
MyIDEAS: Login to save this article or follow this journal

A survey of layout issues in flexible manufacturing systems


Author Info

  • Kouvelis, P
  • Chiang, W-C
  • Kiran, AS
Registered author(s):


    In this paper we survey layout issues in the flexible manufacturing system (FMS) environment. The FMS layout problem deals with the allocation of M stations to M (or more) candidate locations in order to satisfy the throughput requirements of the system. The relevance of quadratic assignment problem (QAP) formulations for the problem is examined. Results from the recent research literature are reported, and many different approaches to the problem are discussed. Emphasis is given on graph theoretic modelling techniques, heuristic approaches for special FMS layout types, and the queueing and dynamic aspects of the layout decisions. Operational and other design issues interacting with layout decisions are also surveyed, and relevant research literature is reported. Promising research directions and interesting open problems for FMS layout researchers are clearly described.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Omega.

    Volume (Year): 20 (1992)
    Issue (Month): 3 (May)
    Pages: 375-390

    as in new window
    Handle: RePEc:eee:jomega:v:20:y:1992:i:3:p:375-390

    Contact details of provider:
    Web page:

    Order Information:

    Related research

    Keywords: machine layout flexible manufacturing quadratic assignment heuristics;


    No references listed on IDEAS
    You can help add them by filling out this form.


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

    Cited by:
    1. Balakrishnan, Jaydeep & Hung Cheng, Chun, 2009. "The dynamic plant layout problem: Incorporating rolling horizons and forecast uncertainty," Omega, Elsevier, vol. 37(1), pages 165-177, February.
    2. Hassan, Mohsen M. D., 1995. "Layout design in group technology manufacturing," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 173-188, March.
    3. Hassan, Mohsen M. D., 2000. "Toward re-engineering models and algorithms of facility layout," Omega, Elsevier, vol. 28(6), pages 711-723, December.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:20:y:1992:i:3:p:375-390. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

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