841 search results - page 41 / 169 » Job Scheduling in Rings |
WSC
2008
15 years 2 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
The performance of computer systems depends, among other things, on the workload. This motivates the use of real workloads (as recorded in activity logs) to drive simulations of n...
ICCSA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
JSSPP
2001
Springer
15 years 4 months ago
2001
Springer
The arrival process of jobs submitted to a parallel system is bursty, leading to fluctuations in the load at many time scales. In particular, rare events of extreme load may occu...
109
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...