Sciweavers

301 search results - page 3 / 61
» Job Sequencing with Exponential Functions of Processing Time...
Sort
View
DISOPT
2008
118views more  DISOPT 2008»
14 years 9 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
CF
2009
ACM
15 years 2 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
SCHOLARPEDIA
2008
83views more  SCHOLARPEDIA 2008»
14 years 8 months ago
Law of series
We consider an ergodic process on finitely many states, with positive entropy. Our first main result asserts that the distribution function of the normalized waiting time for the f...
Tomasz Downarowicz
AAAI
2000
14 years 10 months ago
TCBB Scheme: Applications to Single Machine Job Sequencing Problems
Transpose-and-Cache Branch-and-Bound (TCBB) has shown promise in solving large single machine quadratic penalty problems. There exist other classes of single machine job sequencin...
Sakib A. Mondal, Anup K. Sen
COR
2006
86views more  COR 2006»
14 years 9 months ago
Minimizing the earliness-tardiness costs on a single machine
In this paper the one-machine scheduling problem with linear earliness and tardiness costs is considered. The7 cost functions are job dependent and asymmetric. The problem consist...
Jakub Bauman, Joanna Józefowska