Results 1  10
of
128,491
Online, nonpreemptive scheduling of equallength jobs on two identical machines
 ACM Trans. on Algorithms
"... Abstract. We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as P 2  pj ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, this problem is denoted as P 2
Online scheduling of equallength jobs on parallel machines
 Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP
"... Abstract. We study online scheduling of equallength jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2competitive greedy algorithm. Our algorithm ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. We study online scheduling of equallength jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2competitive greedy algorithm. Our
Scheduling EqualLength Jobs on Identical Parallel Machines
, 2000
"... We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions f i of the completion time C i of each job J i , the problem can be sol ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions f i of the completion time C i of each job J i , the problem can
equallength jobs on one machine with restarts
"... simpler competitive analysis for scheduling ..."
Dispatching Equallength Jobs to Parallel Machines to Maximize Throughput
"... Abstract. We consider online, nonpreemptive scheduling of equallength jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm  rj, pj = p  P 1 − Uj). This problem has been previously studied under two distin ..."
Abstract
 Add to MetaCart
Abstract. We consider online, nonpreemptive scheduling of equallength jobs on parallel machines. Jobs have arbitrary release times and deadlines and a scheduler’s goal is to maximize the number of completed jobs (Pm  rj, pj = p  P 1 − Uj). This problem has been previously studied under two
Preemptive Scheduling of EqualLength Jobs in Polynomial Time
"... Abstract. We study the preemptive scheduling problem of a set of n jobs with release times and equal processing time on a single machine. The objective is to minimize the sum of the weighted completion times Pni=1 wiCi of the jobs, where the number k of different weights is constant. We provide for ..."
Abstract
 Add to MetaCart
Abstract. We study the preemptive scheduling problem of a set of n jobs with release times and equal processing time on a single machine. The objective is to minimize the sum of the weighted completion times Pni=1 wiCi of the jobs, where the number k of different weights is constant. We provide
Online Scheduling of EqualLength Jobs: Randomization and Restarts Help
"... We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a singleprocessor, nonpreemptive schedule of these jobs that maximizes the number of completed jobs. In th ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a singleprocessor, nonpreemptive schedule of these jobs that maximizes the number of completed jobs
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 550 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and animated drawings; it is a general purpose system. Sketchpad has shown the most usefulness as an aid to the understanding of processes, such as the notion of linkages, which can be described with pictures. Sketchpad also makes it easy to draw highly repetitive or highly accurate drawings and to change drawings previously drawn with it. The many drawings in this thesis were all made with Sketchpad.
WordNet: An online lexical database
 International Journal of Lexicography
, 1990
"... WordNet is an online lexical reference system whose design is inspired by current ..."
Abstract

Cited by 1945 (9 self)
 Add to MetaCart
WordNet is an online lexical reference system whose design is inspired by current
Results 1  10
of
128,491