301 search results - page 6 / 61 » Job Sequencing with Exponential Functions of Processing Time... |
SIGMETRICS
2005
ACM
15 years 3 months ago
2005
ACM
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
150
Voted
COCOON
2009
Springer
14 years 7 months ago
2009
Springer
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
The purpose of this contribution is twofold: 1) to present for the first time a Lyapunov function that proves exponential ergodicity of a process studied by the authors in [1], whe...
103
click to vote
SCHEDULING
2008
14 years 9 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
127
click to vote
AAIP
2009
14 years 10 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...