Order-based neighborhoods for project scheduling with nonregular objective functions. (Q1399577): Difference between revisions

The resource-constrained project scheduling problem with general temporal constraints (minimal and maximal time-lags) and nonregular objective functions is studied. It is shown that for certain objective functions the search for an optimal solution can be restricted to special types of schedules. Based on these results appropriate neighborhoods (based on spanning trees of order networks) are developed, which are shown to be weakly connected.