| 主权项 |
1. A system for optimally scheduling a plurality of activities, said system comprising:
a memory configured to store data, wherein said data represents a plurality of activities and said plurality of activities are uncompleted, uncertain activities; an input device for providing said data into said memory; a processor configured to find a subset of said plurality of uncompleted, uncertain activities, as a first stage, that are eligible to be started at said first stage, wherein said eligibility is determined based on one or more eligibility requirements, then generate, for each of said eligible activities found, all feasible sequences of activities that can be executed in a predetermined order following said each of said eligible activity, wherein said feasible sequences of activities satisfy said eligibility requirements and a set of pre-defined constraints, then calculate, for each of said generated feasible sequences, a cost-to-go function, wherein said processor calculates an expected total cost for executing said activities in each of said generated feasible sequences, then select an optimal activity among said eligible activities, wherein said optimal activity is an activity which generates said sequence of activities with said lowest cost-to-go-function, then assign said optimal activity as a completed-activity when said optimal activity is completed, wherein said completion of said optimal activity triggers a second stage, wherein said second stage involves repeating said first stage, with said processor, until all said activities in said plurality of activities are assigned as said completed activity; and an electronic display for viewing said scheduling of activities, wherein said memory, said input device and said electronic display are all electrically connected to said processor. |
