Resource-constrained project scheduling with generalised precedence constraints is a very general scheduling model with applications in areas such as make-to-order production planning. We describe a time-oriented branch-and-bound algorithm that uses constraint-propagation techniques which actively exploit the temporal and resource constraints of the problem in order to reduce the search space. ...

We study the problem of minimizing makespan for part machining on a multi-spindle heads machine with a mobile table. We show that this problem can be formulated as a scheduling problem for a single batch machine with compatibility and precedence constraints between jobs. Jobs grouped in a batch are processed simultaneously, but the difference from considered in the literature max-batch machine ...

In this paper we study an extension of the Resource-Constrained Project Scheduling Problem (RCPSP) with minimum makespan objective by introducing as precedence constraints the so called “Feeding Precedences” (FP). For the RCPSP with FP we propose a new mathematical formulation and a branch and bound algorithm exploiting the latter formulation. The exact algorithm takes advantage also of a lower...

The resource constrained project scheduling problem (RCPSP) can be given as follows. A single project consists of a set J = f0 1 : : : n n + 1 g of activities which h a ve to be processed. Fictitious activities 0 and n + 1 correspond to the \project start" and to the \project end", respectively. The activities are interrelated by t wo kinds of constraints. First, precedence constraints force ac...

The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey resource constraints and precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of this problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow). Large industrial applications can require thousa...

In this article we consider the Rural Postman Problem with Time Windows (RPPTW) for the undirected case. The problem occurs in the monitoring of roads for black-ice detection. We give different formulations and compare them on sets of instances adapted from the literature. We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem wi...

In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a speci ed subset of the machines. Each machine has a loading time that is incurred only for the rst task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines, query optimization in databas...

In this paper we study precedence constrained scheduling problems, where the tasks can only be executed on a speciied subset of the machines. Each machine has a loading time that is incurred only for the rst task that is scheduled on the machine in a particular run. This basic scheduling problem arises in the context of machining on numerically controlled machines , query optimization in databa...

in recent years, wavelet packet modulation ofdm (wpm-ofdm) signals have been introduced for radar applications. these signals have important properties such as inherent high range resolution and high resistance of radar system against jamming reception. this paper investigates the problem of designing these family of signals according to the following criteria: constrained maximization of the d...