关键词: 项目调度, 组合拍卖, 资源约束, 优化, 动态资源价格

Abstract: A project resource allocation method based on combinatorial auction was proposed to solve the resources-constrained multi-project scheduling problem. In combinatorial auctions, a unit of resource within certain time period was regarded as a single bidding object. Dynamic resource price was then introduced for these bidding objects. For an individual project, its schedule was regarded as a combinatorial bid, or a combination of bidding objects. During the auction process, the single project scheduling was required to minimize both the project tardiness and payment for using resources, without violating the precedence relationship and resource constraints. The resource prices were adjusted gradually to reflect the bidding situation and to push competing projects to use resources at low-price time periods. Hence, resource conflicts could be resolved eventually, and a globally optimal scheme of resource allocation among projects could be implemented. A multi-project case was adopted to demonstrate the application of the proposed combinatorial auction method, and the effectiveness of this method was verified.

Key words: project scheduling, combinatorial auction, resource constraint, optimization, dynamic resource price