Results 1  10
of
30
Abstracts Scheduling Resumable Deteriorating Jobs
"... We consider the following singlemachine timedependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj,1 ≤ j ≤ n, to be processed on a single machine, starting from time t0> 0. The processing time pj of job Jj is a pr ..."
Abstract
 Add to MetaCart
We consider the following singlemachine timedependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj,1 ≤ j ≤ n, to be processed on a single machine, starting from time t0> 0. The processing time pj of job Jj is a
Scheduling Split Intervals
, 2002
"... We consider the problem of scheduling jobs that are given as groups of nonintersecting segments on the real line. Each job Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement and Mo ..."
Abstract

Cited by 63 (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 Jj is associated with an interval, Ij, which consists of up to t segments, for some t _) 1, a of their segments intersect. Such jobs show up in a I.I Problem Statement
ONLINE SCHEDULING OF MALLEABLE PARALLEL JOBS
"... In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time will ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we study a parallel job scheduling model which takes into account both computation time and the overhead from communication between processors. Assuming that a job Jj has a processing requirement pj and is assigned to kj processors for parallel execution, then the execution time
Mixedcriticality scheduling
 In 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP
, 2011
"... There is an increasing trend in embedded systems towards implementing multiple functionalities upon a single shared computing platform. This can force tasks of different criticality to share a processor and interfere with each other. These mixedcriticality (MC) systems are the focus of our researc ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
research. We consider the scheduling of finite collections of jobs to be executed on a single machine (processor), allowing preemption. A job in an MC system with L criticality levels is characterized by a 4tuple of parameters: Jj = (rj, dj, χj, cj), where rj is the release time, dj is the deadline (dj
Online Scheduling of Simple Linear Deteriorating Jobs to Minimize Total General Completion Time
, 2012
"... Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. In particular, lots of work has been devoted to jobs with simple linear deterioration. The processing time pj of ..."
Abstract
 Add to MetaCart
of job Jj is a simple linear function of its start time sj, precisely, pj = bjsj, where bj is the deteriorating rate. In this paper, we study the problem of online nonpreemptive scheduling of jobs with arbitrary release times and simple linear deteriorating rates on a single machine to minimize
Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines (Extended Abstract)
, 2012
"... Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. Scheduling of deteriorating jobs was first introduced on a single machine by Browne and Yechiali, and Gupta and Gupta independently. In particular, lots of work has been devoted to jobs with linear deterioration. The processing time pj of job Jj is a linear function of its start time sj, precisely, pj = aj
Optimal Semionline Algorithm for Scheduling on a Batch Processing Machine
"... Abstract. We consider two semionline scheduling problems on a single batch (processing) machine with jobs ’ nondecreasing processing times and jobs ’ nonincreasing processing times, respectively. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultane ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the processing time of job Jj.GivenjobJj and its following job Jj+1, we assume that pj+1 ≥ αpj, whereα≥1isa constant number, for the first problem with jobs ’ nondecreasing processing times. For the second problem, we assume that pj+1 ≤ αpj, where 0 <α<1 is a constant number. We propose an optimal
Online Scheduling with General Cost Functions
"... We consider a general online scheduling problem on a single machine with the objective of minimizing j wjg(Fj), where wj is the weight/importance of job Jj, Fj is the flow time of the job in the schedule, and g is an arbitrary nondecreasing cost function. Numerous natural scheduling objectives are ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
We consider a general online scheduling problem on a single machine with the objective of minimizing j wjg(Fj), where wj is the weight/importance of job Jj, Fj is the flow time of the job in the schedule, and g is an arbitrary nondecreasing cost function. Numerous natural scheduling objectives
Minimizing a Regular Function on Uniform Machines with Ordered Completion Times
, 2010
"... The scheduling problem we are dealing with is the following one. A set of n jobs has to be scheduled on a set of uniform machines. Each machine can handle at most one job at a time. Each job Jj, j = 1,..., n, has an arbitrary due date dj. Job Jj becomes available for processing at its release date r ..."
Abstract
 Add to MetaCart
The scheduling problem we are dealing with is the following one. A set of n jobs has to be scheduled on a set of uniform machines. Each machine can handle at most one job at a time. Each job Jj, j = 1,..., n, has an arbitrary due date dj. Job Jj becomes available for processing at its release date
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
 In Proc. of APPROXRANDOM 2006
, 2002
"... Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1,..., Jn}, where Jj has the processing time pj, and an undirected intersection graph G = ({1, 2,..., n}, E), with an edge (i, j) whenever ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1,..., Jn}, where Jj has the processing time pj, and an undirected intersection graph G = ({1, 2,..., n}, E), with an edge (i, j
Results 1  10
of
30