IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/16635| Title: | Multi-processor exact procedures for regular measures of the multi-mode RCPSP |
| Authors: | Dayal, Madhukar Verma, Sanjay |
| Keywords: | Project scheduling;Regular measures;Exact multi-objective solutions;Breadth-first tree search;Computer-cluster algorithm |
| Issue Date: | 2015 |
| Publisher: | Indian Institute of Management Ahmedabad |
| Abstract: | 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. |
| URI: | http://hdl.handle.net/11718/16635 |
| Appears in Collections: | Working Papers |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| WP2015-03-25.pdf | 882.07 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.