Resource-constrained project scheduling with activity pre-emption assumes that activities are allowed to be interrupted and restarted later in the schedule at no extra cost. In the current paper, we extend this pre-emptive scheduling problem with setup times between activity interruptions and the possibility to fast track pre-emptive subparts of activities. The contribution of the paper is twof...

A constraint propagation (filtering) turned out to be an efficient method how to reduce search space for backtrack-based algorithms. This paper brings several improvements of filtering methods for batch processing with sequence dependent setup times. The first one is domain filtering based on a precedence graph—such filtering can be useful even when no precedences are given at the start. I desc...