Results 1 
7 of
7
Scheduling Split Intervals
"... We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job J j is associated with an interval, I j , which consists of up to t segments, for some t 1, a positive weight, w j , and two jobs are in conflict if any of their segments inte ..."
Abstract

Cited by 51 (5 self)
 Add to MetaCart
We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job J j is associated with an interval, I j , which consists of up to t segments, for some t 1, a positive weight, w j , and two jobs are in conflict if any of their segments intersect. Such jobs show up in a wide range of applications, including the transmission of continuousmedia data, allocation of linear resources (e.g. bandwidth in linear processor arrays), and in computational biology/geometry. The objective is to schedule a subset of nonconflicting jobs of maximum total weight.
Spike: Intelligent scheduling of hubble space telescope observations
 Intelligent Scheduling
, 1994
"... ..."
A Note on Scheduling Identical Coupled Tasks in Constant Time Philippe
"... The coupled tasks problem consists in scheduling n jobs on a single machine. Each job i is made of two operations with processing times ai and bi and a fixed required delay Li between them. Operations cannot overlap in time but operations of different jobs can be interleaved. The objective is to min ..."
Abstract
 Add to MetaCart
The coupled tasks problem consists in scheduling n jobs on a single machine. Each job i is made of two operations with processing times ai and bi and a fixed required delay Li between them. Operations cannot overlap in time but operations of different jobs can be interleaved. The objective is to minimize the makespan of the schedule. In this note we show that the problem with identical jobs (∀i, ai = a, bi = b, Li = L) can be solved in constant time when a, b, L are fixed. This problem is motivated by radar scheduling applications where tasks corresponding to transmitting radiowaves and listening to potential echoes are coupled.
de systèmes complexes
"... Rapport de recherche n ° 4602 — Octobre 2002 — 12 pages Abstract: We consider a system made of one resource. The execution of the tasks is nonpreemptive on this resource. The tasks we consider are composed of a given number of subtasks, two consecutives subtasks being separated by an idle period. T ..."
Abstract
 Add to MetaCart
Rapport de recherche n ° 4602 — Octobre 2002 — 12 pages Abstract: We consider a system made of one resource. The execution of the tasks is nonpreemptive on this resource. The tasks we consider are composed of a given number of subtasks, two consecutives subtasks being separated by an idle period. These idle periods may be used for executing other subtasks. We wish to insert a new task in a given schedule. The characteristics of this task are not known before it appears, and its execution must be completed before a given deadline. The criterion is the minimization of the increase of the sum of the delays of the tasks.
Athènes: Greece (2012)" Identical Coupled Task Scheduling Problem: The Finite Case
, 2012
"... Abstract: Scheduling tasks on a radar system can be modeled as a multioperation scheduling problem where tasks are composed of two operations separated by a fixed duration. Tasks have to be scheduled on a single machine and the aim is to minimize the makespan. The complexity status of this problem h ..."
Abstract
 Add to MetaCart
Abstract: Scheduling tasks on a radar system can be modeled as a multioperation scheduling problem where tasks are composed of two operations separated by a fixed duration. Tasks have to be scheduled on a single machine and the aim is to minimize the makespan. The complexity status of this problem has been settled for various cases but the one where all tasks are identical remains open. This paper aims at showing that this case raises original and difficult problems and is highly unlikely to be polynomial.
(2009)" Complexity and approximation for scheduling problem for a torpedo
"... This paper considers a special case of the coupledtasks scheduling problem on one processor. The general problems were analyzed in depth by Orman and Potts [1]. In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraints, compatibi ..."
Abstract
 Add to MetaCart
This paper considers a special case of the coupledtasks scheduling problem on one processor. The general problems were analyzed in depth by Orman and Potts [1]. In this paper, we consider that all processing times are equal to 1, the gap has exact length L, we have precedence constraints, compatibility constraints are introduced and the criterion is to minimize the scheduling length. We use this problem to study the problem of data acquisition and data treatment of a torpedo under the water. We show that this problem is N Pcomplete and we propose an ρapproximation algorithm where ρ ≤ (L+6) 6