| 摘要(英) |
Businesses are getting more and more competitive, causing the majority of the companies today strive to eliminate the surplus cost of inventory in order to boost their cash flow. Therefore, companies purchase lower quantities of a greater variety of products to increase product diversity. This trend is a benefit to the buyers/customers, but it also creates the opposite effect to the manufacturers. To achieve the balance between customers’ buying criteria and suppliers’ minimum quantity requirements and how to keep the cost of production as unexpansive as possible has become an issue.
This research selects an automobile parts manufacturer to be the case company, and is supported by the literature review and case study to reach the logical conclusion. In addition, it adopts Agglomerative Hierarchical Clustering to collect numerous products of the case company from their bill of material, and place them into different subgroup based on the analysis of their historical data. The research is to develop the solution for case company to manage their future production planning to meet customers’ needs and establish their purchase negotiation strategy with the suppliers; meanwhile, the study can hopefully be valuable for other businesses that are encountering similar situation.
|
| 參考文獻 |
[1] 沈國基、呂俊德、王福川. (2006). 進階ERP企業資源規劃運籌管理. 新北市: 傅和彥.
[2] A. K. Jain, M. N. Murty, P. J. Flynn. (1999). Data clustering: a review. ACM Computing Surveys (CSUR), Page 264-323 .
[3] ANDERBERGR.M. (1973). Cluster Analysis for Applications.
[4] JAIN, A. K. AND FLYNN, P. J. (1996). Advances in Image Understanding: A Festschrift for Azriel Rosenfeld. (Kevin W. Bowyer (Editor)Ahuja (Editor)Narendra,) Piscataway, NJ: Wiley-IEEE Computer Society Press.
[5] RASMUSSEN, E. (1992). Information retrieval: data structures and algorithms. (W. B. Frakes and R. Baeza-Yates) pper Saddle River, NJ, USA: Prentice-Hall, Inc. U.
[6] Anil K. Jain, Richard C. Dubes. (1988). Algorithms for Clustering Data (Prentice Hall Advanced Reference Series : Computer Science). Upper: Prentice-Hall, Inc., .
[7] Peter Henry Andrews Sneath, Robert R. Sokal. (1973). Numerical Taxonomy: The Principles and Practice of Numerical Classification. London, UK: W. H. Freeman.
[8] Karen L. Oehler, Robert M. Gray. (1995). Combining Image Compression and Classification Using Vector Quantization. IEEE Trans. Pattern Anal., Page 461-473.
[9] Michalski, Ryszard S. and Stepp, Robert E. (1983). Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy. Pattern Analysis and Machine Intelligence, IEEE Transactions on, Page 396 - 410.
[10] Peter Henry Andrews Sneath, Robert R. Sokal. (1973). Numerical Taxonomy: The Principles and Practice of Numerical Classification. London, UK: W. H. Freeman.
[11] KingB. (1967). Step-wise clustering procedures. Journal of the American Statistical Association(69), Page 86–101.
[12] Joe. H WardJr. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 301(58), Page 236–244.
[13] MurtaghFionn. (1984). A survey of recent advances in hierarchical clustering algorithms which use cluster centers. . The Computer Journal , Page 354–359.
[14] William B. Frakes, Ricardo Baeza-Yates. (1992). Information Retrieval: Data Structures and Algorithms. NJ: Prentice-Hall, Inc. Upper Saddle River, NJ, USA.
[15] NagyGeorge. (1968). State of the art in pattern recognition. PROCEEDINGS OF THE IEEE(56), Page 836–862.
[16] Carol J. Romanowski and Rakesh Nagi. (2005). On comparing bills of materials: A similarity/distance measure for unordered trees . Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on (Volume:35 , Issue: 2 ), Page 249 - 260.
[17] Pekka Kilpelainen and Heikki Mannila. (1995). Ordered and Unordered Tree Inclusion. SIAM Journal on Computing, Page 340–356.
|
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
至系統瀏覽論文 ( 永不開放)
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit