IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v8y1980i2p193-199.html
   My bibliography  Save this article

Machine-component group formation in group technology

Author

Listed:
  • King, John R

Abstract

A new Rank Order Cluster Algorithm is discussed which provides a simple, effective and efficient analytical technique for the formation of machine-component groupings. The method is specifically developed for computer application although it is possible for it to be used for manual computation, if required, particularly for smaller problems.

Suggested Citation

  • King, John R, 1980. "Machine-component group formation in group technology," Omega, Elsevier, vol. 8(2), pages 193-199.
    • Handle: RePEc:eee:jomega:v:8:y:1980:i:2:p:193-199
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0305-0483(80)90023-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

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


    Cited by:

    1. Rogers, David F. & Kulkarni, Shailesh S., 2005. "Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 160(2), pages 423-444, January.
    2. Nair, G. Jayakrishnan & Narendran, T. T., 1997. "Cluster goodness: A new measure of performance for cluster formation in the design of cellular manufacturing systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 49-61, January.
    3. Yin, Liang & He, Ming-Li & Xie, Wen-Bo & Yuan, Fei & Chen, Duan-Bing & Su, Yang, 2018. "A quantitative model of universalization, serialization and modularization on equipment systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 508(C), pages 359-366.
    4. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.
    5. O. Mahesh & G. Srinivasan, 2006. "Multi-objectives for incremental cell formation problem," Annals of Operations Research, Springer, vol. 143(1), pages 157-170, March.

    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:eee:jomega:v:8:y:1980:i:2:p:193-199. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.