1125 search results - page 88 / 225 » On the job rotation problem |
70
Voted
EOR
2002
15 years 15 days ago
2002
Abstract. We present fully polynomial approximation schemes for the problem of minimizing completion time variance of a set of n jobs on a single machine. The fastest of these sche...
191
click to vote
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...
102
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
The problem of tracking involves challenges like in-plane and out-of-plane rotations, scaling, variations in ambient light and occlusions. In this paper we look at the problem of ...
115
Voted
IPMI
2005
Springer
16 years 1 months ago
2005
Springer
Spherical navigators are an attractive approach to motion compensation in Magnetic Resonance Imaging. Because they can be acquired quickly, spherical navigators have the potential ...
121
Voted
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...