Abstract
A Priority Rule Search Technique (PRST) heuristic computer controlled algorithm is disclosed that schedules single project, single resource and multiple project, multiple resource constrained project scheduling problems. Primary areas of utility include construction, manufacturing and research and development projects. The invention can schedule tasks/activities for large scale, multiple resource and multiple project networks that have different network and resource constraint characteristics while providing balance among different project network characteristics in order to provide an effective solution for a variety of network types. The novel PRST algorithm combines four heuristic rules (ACTM, LFT, MGRD and MACTRES) to determine a priority value for each job task/activity. The priority values are ranked to determine an optimum schedule of all job tasks and activities to complete the entire project. The invention incorporates the time (ACTM and LFT) and resource (MGRD and MACTRES) ch
Document Type
Patent
Patent Number
US 5,671,361
Application Serial Number
08/535,457
Issue Date
9-23-1997
Current Assignee
UCFRF
Assignee at Issuance
UCFRF
College
College of Engineering and Computer Science (CECS)
Department
Industrial Engineering & Management Systems
Allowance Date
1-22-1997
Filing Date
9-28-1995
Assignee at Filing
UCFRF
Filing Type
Nonprovisional Application Record
Donated
no
Recommended Citation
Brown, James and Armacost, Robert, "Priority Rule Search Technique for Resource Constrained Project Scheduling" (1997). UCF Patents. 474.
https://stars.library.ucf.edu/patents/474