1125 search results - page 31 / 225 » On the job rotation problem |
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
JCO
2010
14 years 6 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
114
click to vote
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 4 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
113
click to vote
IJCNN
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper we show that rotational invariance can be improved in a neural network based EIT reconstruction approach by a suitably chosen permutation of the input data. The inpu...
PR
2000
14 years 11 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...