301 search results - page 5 / 61 » Job Sequencing with Exponential Functions of Processing Time... |
AOR
2006
14 years 9 months ago
2006
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
RSA
1998
14 years 9 months ago
1998
We study Galton-Watson branching processes conditioned on the total progeny to be n which are scaled by a sequence cn tending to infinity as o( √ n). It is shown that this proce...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
104
click to vote
AIPS
2006
14 years 10 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
SCHEDULING
2008
14 years 9 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...