Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP
The 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.
Authors: | Madhukar, Dayal ; Verma, Sanjay |
---|---|
Institutions: | Economics, Indian Institute of Management |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Exact Procedures for Non-Regular Measures of the Multi-Mode RCPSP
Madhukar, Dayal,
-
Breadth-first and Best-first Exact Procedures for Regular Measures of the Multi-mode RCPSP
Madhukar, Dayal,
-
Sanjeevan, Kapshe,
- More ...