Exact Procedures for Non-Regular Measures of the Multi-Mode RCPSP

Dayal Madhukar and Sanjay Verma

No WP2015-03-06, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: The multi-mode resource constrained project scheduling problem (MM RCPSP) is a generalization of the well-studied RCPSP. A literature review reveals applications of inexact heuristics or metaheuristics approaches for solving these problems, however, exact approaches are few and do not consider non-renewable resources, as well as, generalized cash inflows and outflows at every time period of an activity, as is the case in real World problem instances. We present two exact solution single-processor approaches: a breadth-first tree search procedure and a best-first monotone heuristic for solving these problem instances. The algorithms are thoroughly tested on problem instances using payment schedules generated for standard PSPLIB problem sets and results presented.

Date: 2015-03-12
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/13421223592015-03-06.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:13265

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().