IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38391-5_78.html
   My bibliography  Save this book chapter

An Approach with Nested Partition for Resource-Constrained Project Scheduling Problem

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Zhen-yuan Liu

    (Huazhong University of Science and Technology
    Key Laboratory of Education Ministry for Image Processing and Intelligent Control)

  • Wen-min Yu

    (Huazhong University of Science and Technology
    Key Laboratory of Education Ministry for Image Processing and Intelligent Control)

Abstract

A time-based nested partition (NP) approach is proposed to solve resource-constrained project scheduling problem (RCPSP) in this paper. In iteration, one activity is selected as the base point of which the finish time interval calculated by CPM is divided into two parts to form two subregions on the basis of the promising region of the last iteration. Then sampling is taken in both subregions and the surrounding region to determine the promising region and aggregate the other as the surrounding region of this iteration so that whether the backtracking or the moving operation being performed is determined. Double justification is also performed in iteration to improve the results. The results of numerical tests on PSPLIB show the effectiveness and time-efficient of the proposed NP method.

Suggested Citation

  • Zhen-yuan Liu & Wen-min Yu, 2013. "An Approach with Nested Partition for Resource-Constrained Project Scheduling Problem," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 737-748, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38391-5_78
    DOI: 10.1007/978-3-642-38391-5_78
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-38391-5_78. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.