Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/17177
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Madhukar, Dayal | |
dc.contributor.author | Verma, Sanjay | |
dc.date.accessioned | 2016-01-01T11:36:11Z | |
dc.date.available | 2016-01-01T11:36:11Z | |
dc.date.copyright | 2014 | |
dc.date.issued | 2014 | |
dc.identifier.uri | http://hdl.handle.net/11718/17177 | |
dc.description.abstract | The 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.iso | en | en_US |
dc.publisher | Indian Institute of Management Ahmedabad | en_US |
dc.relation.ispartofseries | W.P;2014/10/04 | |
dc.subject | Project Scheduling | en_US |
dc.subject | Regular Measures | en_US |
dc.subject | Exact Multi Objective Solutions | en_US |
dc.subject | Breadth - First Tree Search | en_US |
dc.subject | Best - First Monotone Heuristic | en_US |
dc.title | Breadth-first and best-first exact procedures for regular measures of the multi-mode RCPSP | en_US |
dc.type | Working Paper | en_US |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP_2014_10_04.pdf | WP_2014_10_04 | 1.84 MB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.