Run activities as soon or as late as possible in a scheduling problem #641
Replies: 1 comment 1 reply
-
Glad to know! Regarding the issue at end, it is indeed a limitation currently. I think it would be important to address to represent common objective function (notably earliness and tardiness based metrics). One very pragmatic reason is that its underlying representation (int or real) will differ depending on whether the problem considers continuous or discrete time. So we have three types of numeric values: int, real and time. All previous numeric expression handling were focused on int or real, raising an exception if one of the arguments were not in this realm. I think in most cases, they could be relaxed, i.e., allowing a time expression were we previously allowed only int or real. The place where care should be taken however is on the definition of the resulting type. To illustrate that, here is a list of a few expression and their possible types:
|
Beta Was this translation helpful? Give feedback.
-
Hi!
I'm solving
SchedulingProblem
s with the Aries backend and everything works smoothly.However, now I have the need of optimizing the plan so that activities are executed globally as soon as possible.
This is different from optimizing the total makespan, because I have some long running activities that contribute mostly to the makespan while other smaller, concurrent activities are placed arbitrarily in the middle. Those are the ones that I would like to pull as early as possible.
In a different scenario I need to do the same thing but pushing the actions as late as possible within their deadlines.
At first I tried to use
MinimizeExpressionOnFinalState
andMaximizeExpressionOnFinalState
, to minimize or maximize the sum of the starting/ending points of the activities, but it does not work because the expression has to be built on top of numeric fluents, and timepoints are not accepted.So is there currently a way to achieve this?
Beta Was this translation helpful? Give feedback.
All reactions