Sciweavers

388 search results - page 15 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 8 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
EOR
2008
110views more  EOR 2008»
13 years 8 months ago
Runway sequencing with holding patterns
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...
Konstantin Artiouchine, Philippe Baptiste, Christo...
COCOA
2008
Springer
13 years 10 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
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...
Karine Deschinkel, Sid Ahmed Ali Touati
SIP
2003
13 years 10 months ago
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals
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 ...
Iain Russell, Alfred Mertins, Jiangtao Xi
EUROPAR
2009
Springer
14 years 3 months ago
Steady-State for Batches of Identical Task Trees
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...
Sékou Diakité, Loris Marchal, Jean-M...