Research Article
Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm
Table 1
Priority rules used for activity selection.
| | No. | Abbreviation | Name | Formula |
| | (1) | MaxDur | Maximum duration | Max dijm | | (2) | MinDur | Minimum duration | Min dijm | | (3) | MaxRR | Maximum resource requirement | Max | | (4) | MinRR | Minimum resource requirement | Min | | (5) | MaxSuc | Maximum number of direct successors | Max | | (6) | MinSuc | Minimum number of direct successors | Min | | (7) | EST | Earliest starting time | Min | | (8) | EFT | Earliest finishing time | Min | | (9) | LST | Latest starting time | Min | | (10) | LFT | Latest finishing time | Min | | (11) | MaxSLK | Maximum activity-free slack | | | (12) | MinSLK | Minimum activity-free slack | Min | | (13) | MaxRPW | Maximum rank positional weight | Max | | (14) | MinPRW | Minimum rank positional weight | Min | | (15) | MaxCRR | Maximum cumulated resource requirement | Max | | (16) | MinCRR | Minimum cumulated resource requirement | Min | | (17) | MaxCSuc | Maximum cumulated number of successors | Max | | (18) | MinCSuc | Minimum cumulated number of successors | Min |
|
|
