Working Paper Series
|
Stability in a Specialized Supply Chain Setting Issue No. 61 (April - May 2010)
 The stable Supply Chain Network (SCN) configuration, introduced by Ostrovsky [11], is defined on a finite set of agents A that can be divided into k finite disjoint sets, A1 being the set of suppliers, Ak the set of final consumers, and Ai, i={2,3,…,k-1}, the sets of intermediary agents, and asks for a chain stable allocation of the agents. In our current work we present a specialized version of Ostrovsky’s generic framework, and prove that, under this setting, any k-sided SCN can be decomposed to k-1 united SM sub-markets. Moreover, we implement T-algorithm, presented in [11], as a generalization of the Gale-Shapley algorithm [7], and show how an intermediary-optimal solution can be derived, while we prove that the lattice formed by the set of solutions is distributive. Download  List of working papers |
|
Archived Book Chapters
|
K.C. Pramataris, G.I. Doukidis, G. Giaglis, and J. Raptakis. In Pallikarakis N., N. Anselmann, and A. Pernice, editors, Information Exchange for Medical Devices, pages 62-68. IOS Press, Amsterdam, 1996. ISBN 9-051-99249-1. |
|
|
M.P. Bekakos and K.C. Pramataris. In M. Sambandham and M.P. Bekakos, editors, Computational Methods and Neural Networks. Mc-Graw Hill, 1996. |
|
|
|
|
|
|
|
