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

An Improved NSGA-II Algorithm for Resource-Constrained Discrete Time–Cost Tradeoff Problem

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

Author

Listed:
  • Hong Zha

    (Tianjin University)

  • Lian-ying Zhang

    (Tianjin University)

Abstract

In this paper, a resource-constrained discrete time and cost tradeoff problem (RCDTCTP) is considered in knowledge intensive project, where the resources are mainly renewable resource, especially manpower. A multi-objective model for this problem is proposed. In order to illustrate the model, an improved non-dominated sorting genetic algorithm is introduced to solve the model with a numerical example. The results showed that a set of Pareto optimal scheduling alternatives can be obtained in given resource constraints, from which the project stakeholder can choose the preferred alternative.

Suggested Citation

  • Hong Zha & Lian-ying Zhang, 2013. "An Improved NSGA-II Algorithm for Resource-Constrained Discrete Time–Cost Tradeoff 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 159-166, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38433-2_18
    DOI: 10.1007/978-3-642-38433-2_18
    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-38433-2_18. 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.