English  |  正體中文  |  简体中文  |  Items with full text/Total items : 21921/27947 (78%)
Visitors : 4199878      Online Users : 718
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/22197


    Title: An extension to the p-median group technology algorithm
    Authors: Ben-Arieh, D., Chang, P.T.
    Contributors: Department of Industrial Engineering and Enterprise Information, Tunghai University
    Date: 1994
    Issue Date: 2013-05-15T09:12:05Z (UTC)
    Abstract: As suggested by Mulvey and Crowder (1979) and tested by Klastorin (1985), the p-median algorithm is useful for clustering applications. This approach was adopted by Kusiak (1985) and applied to group technology. This paper presents a modification to the p-median clustering algorithm. The new algorithm introduces p, the number of groups, into the objective function; thus, eliminating the iterative nature of the algorithm, and overcoming the difficulty of conjecturing an initial p value. ? 1993.
    Relation: Computers and Operations Research
    Volume 21, Issue 2, February 1994, Pages 119-125
    Appears in Collections:[工業工程與經營資訊學系所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML267View/Open


    All items in THUIR are protected by copyright, with all rights reserved.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback