Previous Page

|

Next Page

The CLP Procedure (Experimental)

The CLP procedure features improved algorithms for the "alldifferent" constraint as well as several extensions to the edgefinder algorithm for resource-constrained scheduling. The EDGEFINDER option can now determine whether an activity must be the first (last) to be scheduled from among a set of activities, while the NF= and NL= options specify the level of propagation for the "not first" and "not last" extensions. A new activity selection strategy RJRAND and a corresponding activity assignment strategy MAXTW have been added; these strategies tend to favor right-justified schedules. The MAXTIME= option enables you to specify a time limit on the CPU time for controlling execution times.