The CLP Procedure |
Functional Summary |
The statements and options available with PROC CLP are summarized by purpose in Table 1.1.
Description |
Statement |
Option |
---|---|---|
variable assignment strategy |
||
activity assignment strategy |
||
activity input data set |
||
constraint input data set |
||
solution output data set |
||
schedule output data set |
||
suppress preprocessing |
||
upper bound on CPU time (seconds) |
||
find all possible solutions |
||
indicate progress in log |
||
number of solutions |
||
activity specifications |
||
resource requirement specifications |
||
resource specifications |
||
scheduling parameters |
||
edge-finder consistency routines |
||
not first edge-finder extension |
||
not last edge-finder extension |
||
activity duration |
DURATION= |
|
activity finish lower bound |
FGE= |
|
activity finish upper bound |
FLE= |
|
activity start lower bound |
SGE= |
|
activity start upper bound |
SLE= |
|
schedule duration |
||
schedule finish |
||
schedule start |
||
dead-end multiplier |
||
number of allowable dead ends per restart |
||
number of search restarts |
||
variable selection strategy |
||
activity selection strategy |
||
all-different constraints |
||
array specifications |
||
for-each constraints |
||
linear constraints |
||
reified constraints |
||
variable specifications |
Note: This procedure is experimental.
Copyright © 2008 by SAS Institute Inc., Cary, NC, USA. All rights reserved.