Multi-processor exact procedures for regular measures of the multi-mode RCPSP

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/16635

Full metadata record

DC Field	Value	Language
dc.contributor.author	Dayal, Madhukar
dc.contributor.author	Verma, Sanjay
dc.date.accessioned	2015-11-10T06:23:12Z
dc.date.available	2015-11-10T06:23:12Z
dc.date.copyright	2015
dc.date.issued	2015
dc.identifier.uri	http://hdl.handle.net/11718/16635
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Indian Institute of Management Ahmedabad	en_US
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	Computer-cluster algorithm	en_US
dc.title	Multi-processor 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
WP2015-03-25.pdf		882.07 kB	Adobe PDF	View/Open