1125 search results - page 4 / 225 » On the job rotation problem |
COR
2011
13 years 3 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
PDPTA
2008
13 years 10 months ago
2008
- For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. ...
PDPTA
2004
13 years 10 months ago
2004
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
IFIPTCS
2010
13 years 6 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...