A composite multi-criteria search technique for resource-constrained project scheduling problems

Download
Full text for this resource is not available from the Research Repository.
Export

Tsao, De-bi and Ahsan, Kamrul (2003) A composite multi-criteria search technique for resource-constrained project scheduling problems. Journal of Japan Industrial Management Association, 54 (5). pp. 326-332. ISSN 0386-4812

Abstract

This paper proposes an improved SLA^* (search and learning A^* algorithm) for solving resource-constrained project scheduling problems. The objective is to reduce the amount of SLA^* backtracking. Resource utilization and number of parallel processing activities are two new criteria of the proposed algorithm. The proposed algorithm combines those three criteria : (1) resource utilization, (2) total heuristic estimate, and (3) number of parallel processing activities. The composite criteria are used at the front state selection of the SLA^* procedure. The performance of the proposed algorithm is analyzed with different problems. The problems are characterized by problem scale, network complexity, resource factor and resource tightness. Computational results show that the proposed algorithm reduces backtracking more than 50% on average compared to the original SLA^* giving optimal or near optimal solutions.

Additional Information

Article is written in Japanese
Item type Article
URI https://vuir.vu.edu.au/id/eprint/24481
Official URL http://ci.nii.ac.jp/els/110004050417.pdf?id=ART000...
Subjects Historical > FOR Classification > 0802 Computation Theory and Mathematics
Historical > FOR Classification > 1503 Business and Management
Historical > Faculty/School/Research Centre/Department > College of Business
Keywords project management, resource-constrained scheduling, search algorithm, algorithms, searching, heuristics, multi-criteria, projects, schedules
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login

CORE (COnnecting REpositories)