As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
An important problem in scheduling is ensuring predictability of solutions in case of execution delays. We propose a new method, task grouping, and apply it in combination with a precedence constraint posting algorithm to solve the resource-constrained project scheduling problem. Using this method tasks that must be executed sequentially can be grouped, but their definitive order is determined at execution time such that delays can sometimes be mitigated. As a consequence, our method generates a set of execution options for a schedule. Using the well-known PSPLIB instances, we show that our method can reduce the impact of delays on the predictability of schedule execution.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.