Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8327
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Vikash-
dc.contributor.authorUpadhyay, Rajeev Kumar-
dc.contributor.authorPathak, Bhupendra Kumar-
dc.date.accessioned2022-11-23T05:36:34Z-
dc.date.available2022-11-23T05:36:34Z-
dc.date.issued2013-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8327-
dc.description.abstractIn this paper study of time cost trade off problems (TCTP) have been carried out. This study shows different outcomes of previous research papers with application of various techniques/algorithms used to solve time cost trade off problems. In this review use of analytical techniques such as critical path method (CPM), Project Evaluation Review Technique (PERT), mathematical methods (linear programming, integer programming), heuristic methods (simulated annealing) and evolutionary algorithms (genetic algorithm) in different areas of project scheduling problems have been focused. Keywords- Project Scheduling, Time Cost Trade off Problems, Genetic Algorithmen_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectArt reviewen_US
dc.subjectTime costen_US
dc.subjectProject schedulingen_US
dc.titleA State of Art Review on Time Cost Trade off Problems in Project Schedulingen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
A State of Art Review on Time Cost Trade off Problems in Project Scheduling.pdf264.15 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.