388 search results - page 15 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
HEURISTICS
2002
14 years 11 months ago
2002
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
EOR
2008
14 years 11 months ago
2008
We study a scheduling problem, motivated by air-traffic control, in which a set of aircrafts are about to land on a single runway. When coming close to the landing area of the air...
104
Voted
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
107
Voted
SIP
2003
2003
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
15 years 1 months ago
This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the ...
EUROPAR
2009
Springer
15 years 6 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...