Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms

doi:10.6186%2fIJIMS.201906_30(2).0004

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 期刊論文 > Item 987654321/119638

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/119638

題名:	Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
作者:	Cheng, Chi-Bin;Lo, Chiao-Yu;Chu, Chih-Ping
關鍵詞:	Multi-project scheduling;resource dedication;bi-level decentralized programming;combinatorial optimization;fuzzy logic
日期:	2019-06
上傳時間:	2020-11-25 12:10:33 (UTC+8)
摘要:	This study solves a multi-project, multi-mode, and resource-constrained project scheduling problem. Multi-mode means that the activities in a project can be accomplished in one out of several execution modes, each of which represents an alternative combination of resource requirement of the activity. The present study considers the case that the resources need to be allocated first to individual projects by the upper-level manager, and then the project manager of each project schedules the project to optimize its outcome. In view of such a hierarchical decision-making structure, this study uses bi-level decentralized programming to model the problem. The proposed solution procedure employs combinatorial auction mechanisms to determine resource allocations to projects. A regular combinatorial auction and a fuzzy combinatorial auction are used, respectively, for cases of hard and soft capacity constraints. The proposed solution procedure is evaluated by comparison with the results reported in the literature.
關聯:	International Journal of Information and Management Sciences 30(2), P143 - 167
DOI:	10.6186%2fIJIMS.201906_30(2).0004
顯示於類別:	[資訊管理學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	99	檢視/開啟
Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction .pdf		372Kb	Adobe PDF	115	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....