Learn More
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. We introduce new lower bounds and we generalize some well-known dominance properties. Our procedure handles instances as large as 500 jobs although some 60 jobs instances remain open. Computational results show that the proposed(More)
We study the parallel machine scheduling problem with release dates and we consider several " min-sum " objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to(More)
We address the parallel machine total weighted tardiness scheduling problem with release dates. We describe dominance rules and filtering methods for this problem. Most of them are adaptations of dominance rules based on solution methods for the single-machine problem. We show how it is possible to deduce whether or not certain jobs can be processed by a(More)
The aim of this paper is to study the concept of a " dominance rule " in the context of combi-natorial optimization. A dominance rule is established in order to reduce the solution space of a problem by adding new constraints to it, either in a procedure that aims to reduce the domains of variables, or directly in building interesting solutions. Dominance(More)
Object association is a crucial step in target tracking and data fusion applications. This task can be formalized as the search for a relation between two sets (e.g., a sets of tracks and a set of observations) in such a way that each object in one set is matched with at most one object in the other set. In this paper, this problem is tackled using the(More)