1125 search results - page 34 / 225 » On the job rotation problem |
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
IPCO
1998
13 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
IPL
2008
13 years 9 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
WSC
1997
13 years 11 months ago
1997
For many companies the scheduling of job shops proves very difficult. Competing priorities (due dates, potential profit) from multiple customers confronts the plant manager with m...
HPDC
2008
IEEE
14 years 4 months ago
2008
IEEE
As grid computation systems become larger and more complex, manually diagnosing failures in jobs becomes impractical. Recently, machine-learning techniques have been proposed to d...