In this paper we adress a new cyclic problem: finding periodic schedules for unitary resource constrained cyclic scheduling problem. Such resource constraints are characterized by k, the number of types of functional units employed and mx the maximal number of processors of the same type. The main problem is to cope with both precedence delays and resources which make the problem NP-complete in...

Projects are an important part of our activities and regardless of their magnitude, scheduling is at the very core of every project. In an ideal world makespan minimization, which is the most commonly sought objective, would give us an advantage. However, every time we execute a project we have to deal with uncertainty; part of it coming from known sources and part remaining unknown until it af...

This paper reports on a new solution approach for the well-known multi-mode resource-constrained project scheduling problem (MMRCPSP). This problem type aims at the selection of a single activity mode from a set of available modes in order to construct a precedence and a (renewable and non-renewable) resource feasible project schedule with a minimal makespan. The problem type is known to be NPh...

Nowadays there exists a wide variety of automatic machines that perform analytical tests on liquid samples, such as water, blood, urines, saliva, etc. A test can be modelled set activities with given precedences and through sharing limited resources. scheduling process is therefore required to find feasible or optimal execution tests. An important particularity the performing are their storage ...

The resource-constrained project scheduling problem (RCPSP) is a well-known that has attracted attention since several decades. Despite the rapid progress of exact and (meta-)heuristic procedures, can still not be solved to optimality for many instances relatively small size. Due known complexity, researchers have proposed fast efficient meta-heuristic solution procedures solve near optimality....

s of Papers in the Main CP 2011 Conference A constraint based approach to cyclic RCPSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini Solving MAXSAT by Solving a Sequence of Simpler SAT Instances . . . . . . . . . . . . . . . . 98 Jessica Davies and Fahiem Bacchus Filtering Algorithms for Discrete Cumulative Problem...

Edge Finding filtering algorithm is one of the reasons why Constraint Programming is a successful approach in the scheduling domain. However edge finding for cumulative resources was never as successful as edge finding for disjunctive resources. This paper presents a new variant of the edge finding algorithm which improves filtering by taking into account minimum capacity profile a data structu...