東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Distributed Decision Algorithms for ...

Yilmaz, Ibrahim.

Linked to FindBook

Google Book

Amazon

博客來

Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks./
Author:	Yilmaz, Ibrahim.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
Description:	102 p.
Notes:	Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.
Contained By:	Dissertation Abstracts International79-09B(E).
Subject:	Industrial engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10791525
ISBN:	9780355858648

Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks.
Yilmaz, Ibrahim.

Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 102 p.

Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.

Thesis (Ph.D.)--State University of New York at Binghamton, 2018.

This research addresses distributed decisions for to enhance fairness and total profit among collaborative networked enterprises (CNEs). The arbitrary nature of demand and capacity patterns in manufacturing/service enterprises require to form a CNE with other enterprises to overcome such uncertainties. In any CNE, the collaboration process often leads to a dilemma: the need to choose between fairness and total profit. The aim of this research is to investigate a new sharing protocol (SP) to control CNEs and to propose an algorithm that attempts to increase optimal weights of fairness while maintaining total profit. Most CNE research studies have been designed under a centralized SP. However, centralized SPs appear to be unfeasible or inadequate because of enterprises' operating environments and local objectives; therefore, each CNE requires a distributed decision-making mechanism. Furthermore, market globalization and competition necessitate rapid responses to market changes and give rise to two major concerns about CNEs: 1) how can collaborations be rendered re-configurable to dynamically capture and adapt to market patterns; and 2) how can the resources of all CNEs be utilized fairly among enterprises, ensuring mutual benefits? Therefore, Dynamic-Distributed Sharing Protocol (D2SP ), which is inspired by the principles of Collaborative Control Theory and the Contract Net Protocol, is proposed to address these concerns. Under the assumptions used in this research, experimental results and analyses indicate that D2SP reduces the number of messages and inventory cost of shared amounts by up to 30%, and 9%, respectively and total profit and fairness index are increased by up to 15% and 10%, respectively. The proposed algorithm in which Jain's fairness index and the generalized alpha-fair concept are utilized, is tested with conceptual heterogeneous and homogeneous CNs (HeCNs and HoCNs, respectively) based on the enterprise capacity. Experimental results indicate that fairness increases up to 28% in HeCN and 32% in HoCN while maintaining the current total profit of a CN. The gap between two CNEs, which are the most benefited and least benefited enterprises in terms of total profit, lost sale cost, and inventory cost, can reduce up to 57%, 54%, and 78%, respectively. Therefore, the proposed algorithm can minimize the deviation between most and least beneficial CNEs in terms of total profit, lost sale cost, and inventory cost.

ISBN: 9780355858648Subjects--Topical Terms:

526216
Industrial engineering.

Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks.
LDR:03466nmm a2200313 4500 001 2160851
005 20180727125214.5
008 190424s2018 ||||||||||||||||| ||eng d
020 $a 9780355858648
035 $a (MiAaPQ)AAI10791525
035 $a (MiAaPQ)binghamton:12676
035 $a AAI10791525
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yilmaz, Ibrahim. $3 1940006
245 1 0 $a Distributed Decision Algorithms for Fair Resource Allocations in Collaborative Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 102 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-09(E), Section: B.
500 $a Adviser: Sang W. Yoon.
502 $a Thesis (Ph.D.)--State University of New York at Binghamton, 2018.
520 $a This research addresses distributed decisions for to enhance fairness and total profit among collaborative networked enterprises (CNEs). The arbitrary nature of demand and capacity patterns in manufacturing/service enterprises require to form a CNE with other enterprises to overcome such uncertainties. In any CNE, the collaboration process often leads to a dilemma: the need to choose between fairness and total profit. The aim of this research is to investigate a new sharing protocol (SP) to control CNEs and to propose an algorithm that attempts to increase optimal weights of fairness while maintaining total profit. Most CNE research studies have been designed under a centralized SP. However, centralized SPs appear to be unfeasible or inadequate because of enterprises' operating environments and local objectives; therefore, each CNE requires a distributed decision-making mechanism. Furthermore, market globalization and competition necessitate rapid responses to market changes and give rise to two major concerns about CNEs: 1) how can collaborations be rendered re-configurable to dynamically capture and adapt to market patterns; and 2) how can the resources of all CNEs be utilized fairly among enterprises, ensuring mutual benefits? Therefore, Dynamic-Distributed Sharing Protocol (D2SP ), which is inspired by the principles of Collaborative Control Theory and the Contract Net Protocol, is proposed to address these concerns. Under the assumptions used in this research, experimental results and analyses indicate that D2SP reduces the number of messages and inventory cost of shared amounts by up to 30%, and 9%, respectively and total profit and fairness index are increased by up to 15% and 10%, respectively. The proposed algorithm in which Jain's fairness index and the generalized alpha-fair concept are utilized, is tested with conceptual heterogeneous and homogeneous CNs (HeCNs and HoCNs, respectively) based on the enterprise capacity. Experimental results indicate that fairness increases up to 28% in HeCN and 32% in HoCN while maintaining the current total profit of a CN. The gap between two CNEs, which are the most benefited and least benefited enterprises in terms of total profit, lost sale cost, and inventory cost, can reduce up to 57%, 54%, and 78%, respectively. Therefore, the proposed algorithm can minimize the deviation between most and least beneficial CNEs in terms of total profit, lost sale cost, and inventory cost.
590 $a School code: 0792.
650 4 $a Industrial engineering. $3 526216
650 4 $a Systems science. $3 3168411
650 4 $a Operations research. $3 547123
690 $a 0546
690 $a 0790
690 $a 0796
710 2 $a State University of New York at Binghamton. $b Systems Science Industrial Engineering. $3 2104041
773 0 $t Dissertation Abstracts International $g 79-09B(E).
790 $a 0792
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10791525