Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
學年 107
學期 2
出版（發表）日期 2019-06-01
作品名稱 Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
作品名稱（其他語言）
著者 Chi-Bin Cheng; Chiao-Yu Lo; Chih-Ping Chu
單位
出版者
著錄名稱、卷期、頁數 International Journal of Information and Management Sciences 30(2), P143 - 167
摘要 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.
關鍵字 Multi-project scheduling;resource dedication;bi-level decentralized programming;combinatorial optimization;fuzzy logic
語言 en_US
ISSN 1017-1819
期刊性質 國內
收錄於
產學合作
通訊作者
審稿制度 否
國別 TWN
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/119638 )