A multi-unit combinatorial auction based approach for decentralized multi-project scheduling
In industry, many problems are considered as the decentralized resource-constrained multi-project scheduling problem (DRCMPSP). Existing approaches encounter difficulties in dealing with large DRCMPSP cases while respecting the information privacy requirements of the project agents. In this paper, w...
Main Authors: | Song, Wen, Kang, Donghun, Zhang, Jie, Xi, Hui |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/83124 http://hdl.handle.net/10220/49103 |
Similar Items
-
Multi-Unit Auction Revenue with Possibilistic Beliefs
by: Micali, Silvio, et al.
Published: (2017) -
Bidding Lower with Higher Values in Multi-Object Auction
by: McAdams, David
Published: (2002) -
Monotone Equilibrium in Multi-Unit Auctions
by: McAdams, David
Published: (2002) -
A projection and decomposition approach for multi-agent coordinated scheduling in power systems
by: Qiu, Haifeng, et al.
Published: (2024) -
New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies)
by: Chen, Jing, et al.
Published: (2008)