Please use this identifier to cite or link to this item: https://doi.org/10.1016/S0957-4174(03)00137-4
Title: A dynamic project allocation algorithm for a distributed expert system
Authors: Cheung, Y. 
Hong, G.M. 
Ang, K.K. 
Keywords: Allocation
Dynamic programming
Expert systems
Integer programming
Optimization
Issue Date: Feb-2004
Citation: Cheung, Y., Hong, G.M., Ang, K.K. (2004-02). A dynamic project allocation algorithm for a distributed expert system. Expert Systems with Applications 26 (2) : 225-232. ScholarBank@NUS Repository. https://doi.org/10.1016/S0957-4174(03)00137-4
Abstract: One of the major concerns of a distributed expert system is to provide optimal solution to a business process characterized by an operations research model. Based on the concept of dynamic programming, the paper presents an efficient computer algorithm which solves an Integer Programming Model for optimally allocating Final Year Projects to more than 200 fourth year BSc students in Department of Civil Engineering (CE), National University of Singapore (NUS), subject to the operation constraints of students' ranking, personal preference and project availability. Having been implemented as part of a distributed project allocation system, the algorithm has improved tremendously the operation efficiency of FYP allocation, by a factor of more than 600 times with a flawless accuracy as compared to its counterpart generated by a previously-adopted manual processing procedure. In light of the dynamic programming pattern abstracted from this system, the allocation algorithm has the potential of being extended to building other distributed merit-based expert systems. © 2003 Elsevier Ltd. All rights reserved.
Source Title: Expert Systems with Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/54107
ISSN: 09574174
DOI: 10.1016/S0957-4174(03)00137-4
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.