๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A comprehensive clustering algorithm for strategic analysis of supply chain networks

โœ Scribed by Mukundan Srinivasan; Young B. Moon


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
205 KB
Volume
36
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

โœฆ Synopsis


Inventory management in supply chain networks involves keeping track of hundreds of items spread across multiple locations with complex interrelationships between them. However, it is not computationally feasible to consider each item individually during the decision making process. The use of clusters of items is preferred for the evaluation of these decisions. In addition, the use of groups of items provides management with more eective methods for characterizing and controlling system performance and results in cost savings such as group discounts. In this research, we introduce a comprehensive clustering methodology for supporting inventory management in supply chain networks. All product characteristics which have a signiยฎcant impact on the performance of the supply chain are taken into account. The nodes in the network are split into subnodes prior to clustering to reduce the complexity. The average linkage clustering algorithm and the Calinski and Harabasz index are used to identify clusters of similar items. In addition, a set of heuristics is used to capture the relationships between items as speciยฎed in the bill of materials for the products. Examples are presented to demonstrate the eectiveness of the clustering methodology as well as the performance of the heuristics, by comparing the results obtained with the optimal solution.


๐Ÿ“œ SIMILAR VOLUMES


Clustering-based scheduling: A new class
โœ Sophia G. Petridou; Panagiotis G. Sarigiannidis; Georgios I. Papadimitriou; Andr ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 279 KB

## Abstract In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these a

A comprehensive unified set of single-st
โœ S.C. Fan; T.C. Fung; G. Sheng ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 646 KB

In Part I, a comprehensive unified set of single-step algorithms with controllable dissipation based on the generalized Galerkin formulation was presented. In this paper, the details of four lower-order algorithms using parametrized temporal finite element are presented. The analyses of the numerica