1125 search results - page 14 / 225 » On the job rotation problem |
SIAMCOMP
2010
13 years 3 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
DISOPT
2008
13 years 8 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
PRIS
2004
13 years 10 months ago
2004
Abstract. This paper treats on rotation absorption in neural networks for multioriented character recognition. Classical approaches are based on several rotation invariant features...
AAIM
2007
Springer
14 years 2 months ago
2007
Springer
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...