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 |
|
2007 Conference Publications
|
A. Karagiannaki, I. Mourtos and K. Pramatari: Simulating and evaluating the impact of RFID on warehousing operations: a case study, Proceedings of SCSC’07, 34 (2007). |
|
|
P. Eirinakis, D. Magos, I. Mourtos, Ioannis, P. Miliotis, Hyperarc Consistency for the Stable Admissions Problem, 19th IEEE International Conference on Tools with Artificial Intelligence, 2007 (ICTAI 2007) 1, 239-242. |
|
Theotokis A. , Vlachos P. , Pramatari K. In the Proceedings of 14th Conference on Retailing and Consumer Services, San-Francisco,July 2007 |
|
Vasilios Koutsiouris, Costas Polychronopoulos, Adam Vrechopoulos. In the Sixth International Conference on Mobile Business (ICMB 2007), July 9-11, 2007.Toronto, Canada. |
|
C. Bardaki, K. Pramatari, G. Doukidis. Proceedings of the 20th Bled Electronic Commerce Conference, June 3-6 2007, Bled, Slovenia. |
|
|
|
|
<< Start < Prev 1 2 3 4 Next > End >>
|
|
Page 1 of 4 |
|
|
