Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1113
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBhaskar, Tarun
dc.contributor.authorPal, Manabendra N.
dc.contributor.authorPal, Asim Kumar
dc.date.accessioned2021-08-26T06:03:27Z-
dc.date.available2021-08-26T06:03:27Z-
dc.date.issued2011
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78649450738&doi=10.1016%2fj.ejor.2010.07.021&partnerID=40&md5=30c81267cdcf8dc3b4bea3b4cedbca03
dc.identifier.urihttps://ir.iimcal.ac.in:8443/jspui/handle/123456789/1113-
dc.descriptionBhaskar, Tarun, Computing and Decision Sciences Lab, GE India Technology Centre, Bangalore, India; Pal, Manabendra N., Indian Institute of Management Calcutta, Kolkata 700104, India; Pal, Asim Kumar, Indian Institute of Management Calcutta, Kolkata 700104, India
dc.descriptionISSN/ISBN - 03772217
dc.descriptionpp.57-66
dc.descriptionDOI - 10.1016/j.ejor.2010.07.021
dc.description.abstractIn this paper, we propose a heuristic method for resource constrained project scheduling problem with fuzzy activity times. This method is based on priority rule for parallel schedule generation scheme. Calculation of critical path in this case requires comparison of fuzzy numbers. Distance based ranking of fuzzy number is used for finding the critical path length and concept of shifting criticality is proposed for some of the special cases. We also propose a measure for finding the non-integer power of a fuzzy number. We discuss some properties of the proposed method. We use an example to illustrate the method. � 2010 Elsevier B.V. All rights reserved.
dc.publisherSCOPUS
dc.publisherEuropean Journal of Operational Research
dc.relation.ispartofseries208(1)
dc.subjectCritical path
dc.subjectFuzzy number
dc.subjectProject scheduling
dc.subjectTime
dc.titleA heuristic method for RCPSP with fuzzy activity times
dc.typeArticle
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.


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