1125 search results - page 22 / 225 » On the job rotation problem |
SPIRE
2000
Springer
2000
Springer
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
14 years 1 months ago
We consider the problem of defining and evaluating the distance between three
COLOGNETWENTE
2008
13 years 11 months ago
2008
In this paper we consider the online scheduling of jobs, which require processing on a number of machines simultaneously. These jobs are presented to a decision maker one by one, ...
ORL
2006
13 years 9 months ago
2006
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
MICS
2010
13 years 8 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
35
Voted
AOR
2006
13 years 10 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...