Header menu link for other important links
X
Breadth-first and Best-first Exact Procedures for Regular Measures of the Multi-mode RCPSP
, Sanjay Verma
Published in INDIAN INSTITUTE OF MANAGEMENT
2014
Pages: 2 - 56
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.

About the journal
JournalINDIAN INSTITUTE OF MANAGEMENT AHMEDABAD
PublisherINDIAN INSTITUTE OF MANAGEMENT
Open AccessYes
Concepts (5)
  •  related image
    Project scheduling
  •  related image
    Regular measures
  •  related image
    Exact multi objective solutions
  •  related image
    Breadth-first tree search
  •  related image
    Best-first monotone heuristic.