Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/16635
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDayal, Madhukar
dc.contributor.authorVerma, Sanjay
dc.date.accessioned2015-11-10T06:23:12Z
dc.date.available2015-11-10T06:23:12Z
dc.date.copyright2015
dc.date.issued2015
dc.identifier.urihttp://hdl.handle.net/11718/16635
dc.description.abstractThe multi-mode resource-constrained project scheduling problem (MM RCPSP) is an NP-hard problem representing a generalization of the well-studied RCPSP. Depth-first tree search approach by Sprecher & Drexl (1998) is the best-known exact solution tree search procedure for this problem. In this paper we modify an existing breadth-first algorithm for multiple processors. It is a computer-cluster implementation of the breadth-first procedure which improves the solution time taken for these problem instances.en_US
dc.language.isoenen_US
dc.publisherIndian Institute of Management Ahmedabaden_US
dc.subjectProject schedulingen_US
dc.subjectRegular measuresen_US
dc.subjectExact multi-objective solutionsen_US
dc.subjectBreadth-first tree searchen_US
dc.subjectComputer-cluster algorithmen_US
dc.titleMulti-processor exact procedures for regular measures of the multi-mode RCPSPen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP2015-03-25.pdf882.07 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.