English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62570/95233 (66%)
Visitors : 2551073      Online Users : 288
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/119638

    Title: Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction Mechanisms
    Authors: Cheng, Chi-Bin;Lo, Chiao-Yu;Chu, Chih-Ping
    Keywords: Multi-project scheduling;resource dedication;bi-level decentralized programming;combinatorial optimization;fuzzy logic
    Date: 2019-06
    Issue Date: 2020-11-25 12:10:33 (UTC+8)
    Abstract: 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.
    Relation: International Journal of Information and Management Sciences 30(2), P143 - 167
    DOI: 10.6186%2fIJIMS.201906_30(2).0004
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    Solving Multi-Mode Resource-Constrained Multi-Project Scheduling Problem with Combinatorial Auction .pdf372KbAdobe PDF88View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback