Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17177
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMadhukar, Dayal
dc.contributor.authorVerma, Sanjay
dc.date.accessioned2016-01-01T11:36:11Z
dc.date.available2016-01-01T11:36:11Z
dc.date.copyright2014
dc.date.issued2014
dc.identifier.urihttp://hdl.handle.net/11718/17177
dc.description.abstractThe multi-mode resource constrained project scheduling problem (MM RCPSP) is a 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 present two exact solution single-processor approaches: a breadth-first approach and a best-first monotone heuristic. The comparison with depth-first and CPLEX show promising results on small problem sets. We report extension of the breadth-first approach to yield exact multi-objective solutions for the PSPLIB (Project Scheduling Problem Library, Kolisch & Sprecher, 1997) problem sets which is the first of its kind.en_US
dc.language.isoenen_US
dc.publisherIndian Institute of Management Ahmedabaden_US
dc.relation.ispartofseriesW.P;2014/10/04
dc.subjectProject Schedulingen_US
dc.subjectRegular Measuresen_US
dc.subjectExact Multi Objective Solutionsen_US
dc.subjectBreadth - First Tree Searchen_US
dc.subjectBest - First Monotone Heuristicen_US
dc.titleBreadth-first and best-first 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 
WP_2014_10_04.pdfWP_2014_10_041.84 MBAdobe PDFView/Open


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