The success of constraint programming on scheduling problems comes from the low complexity and power propagators. data structure Profile recently introduced by Gingras Quimper in Generalizing edge-finder rule for cumulative constraint. In: IJCAI, IJCAI/AAAI Press, pp 3103–3109, 2016, when applied to resource (which we call horizontally elastic edge-finder) has improved filtering this rule. In p...

We present two constraints that partition the vertices of an undirected n-vertex, m-edge graph G = (V, E) into a set of vertex-disjoint trees. The first is the resource-forest constraint, where we assume that a subset R ⊆ V of the vertices are resource vertices. The constraint specifies that each tree in the forest must contain at least one resource vertex. This is the natural undirected counte...

This paper describes work in progress to enhance the performance of the Ground Processing Scheduling System (GPSS). The GPSS is a constraint-based scheduler that deals with three kinds of constraints: temporal, resource, and connguration. It starts with a complete schedule that may have some constraint violations (connicts) and gradually improves the schedule by reducing the violations. The obj...

On the basis of uncertainty theory, plenty of researches have been done on uncertain resource-constrained project scheduling problems. Instead of minimizing the makespan, in this paper, we address the maximization of net present value of a project’s cash flows when activity durations are assumed to be uncertain. In addition to precedence constraint and resource constraint involved in resource-c...

The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage assignment in warehouses. These applications often necessitate considering a rich set of requirements and preferences, which makes constraint programming (CP) an effective modeling and solving approach. On the other han...

Alternative resource constraint problems have to be solved in practical applications where several resources are available for the activities to be scheduled. In this paper, we present a modular approach to solve such problems which is based on single resource constraints. Furthermore, we present a new sweeping algorithm which performs some “global” overload checking for the alternative resourc...

Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...

Freuder 9] has previously given conditions that guarantee backtrack-free search when solving binary constraint networks. Freuder's condition relies on the \width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of the vertices in the network. This paper presents an similar result for backtrack-free search when solving resour...