Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/83124
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSong, Wenen
dc.contributor.authorKang, Donghunen
dc.contributor.authorZhang, Jieen
dc.contributor.authorXi, Huien
dc.date.accessioned2019-07-03T04:22:33Zen
dc.date.accessioned2019-12-06T15:12:16Z-
dc.date.available2019-07-03T04:22:33Zen
dc.date.available2019-12-06T15:12:16Z-
dc.date.issued2017en
dc.identifier.citationSong, W., Kang, D., Zhang, J., & Xi, H. (2017). A multi-unit combinatorial auction based approach for decentralized multi-project scheduling. Autonomous Agents and Multi-Agent Systems, 31(6), 1548-1577. doi:10.1007/s10458-017-9370-zen
dc.identifier.issn1387-2532en
dc.identifier.urihttps://hdl.handle.net/10356/83124-
dc.description.abstractIn 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, we tackle DRCMPSP by formulating it as a multi-unit combinatorial auction (Wellman et al. in Games Econ Behav 35(1):271–303, 2001), which does not require sensitive private project information. To handle the hardness of bidder valuation, we introduce the capacity query which uses different item capacity profiles to efficiently elicit valuation information from bidders. Based on the capacity query, we adopt two existing strategies (Gonen and Lehmann in Proceedings of the 2nd ACM conference on electronic commerce, pp 13–20, 2000) for solving multi-unit winner determination problems to find good allocations of the DRCMPSP auctions. The first strategy employs a greedy allocation process, which can rapidly find good allocations by allocating the bidder with the best answer after each query. The second strategy is based on a branch-and-bound process to improve the results of the first strategy, by searching for a better sequence of granting the bids from the bidders. Empirical results indicate that the two strategies can find good solutions with higher quality than state-of-the-art decentralized approaches, and scale well to large-scale problems with thousands of activities from tens of projects.en
dc.description.sponsorshipNRF (Natl Research Foundation, S’pore)en
dc.language.isoenen
dc.relation.ispartofseriesAutonomous Agents and Multi-Agent Systemsen
dc.rights© 2017 The Author(s). All rights reserved.en
dc.subjectEngineering::Computer science and engineeringen
dc.subjectMulti-project Schedulingen
dc.subjectMulti-unit Combinatorial Auctionen
dc.titleA multi-unit combinatorial auction based approach for decentralized multi-project schedulingen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.contributor.researchRolls-Royce@NTU Corporate Laben
dc.identifier.doi10.1007/s10458-017-9370-zen
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:SCSE Journal Articles

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.