301 search results - page 1 / 61 » Job Sequencing with Exponential Functions of Processing Time... |
INFORMATICALT
2006
13 years 10 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
JCO
2007
13 years 10 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
ICNS
2007
IEEE
14 years 5 months ago
2007
IEEE
The existence of good probabilistic models for the job arrival process and the delay components introduced at the different stages of job processing in a Grid environment is impor...
EOR
2006
13 years 11 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
HPDC
2006
IEEE
14 years 4 months ago
2006
IEEE
Grid applications that use a considerable number of processors for their computations need effective predictions of the expected computation times on the different nodes. Currentl...