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

Hong Zha (zhahong@tju.edu.cn) and Lian-ying Zhang
Additional contact information
Hong Zha: Tianjin University
Lian-ying Zhang: Tianjin University

Chapter Chapter 18 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 159-166 from Springer

Abstract: 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.

Keywords: Improved NSGA-II; Multi-objective; Project scheduling; Time–cost tradeoff (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-38433-2_18

Ordering information: This item can be ordered from
http://www.springer.com/9783642384332

DOI: 10.1007/978-3-642-38433-2_18

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).