1758 search results - page 38 / 352 » Schedule processes, not VCPUs |
146
click to vote
WSC
1997
15 years 8 months ago
1997
This paper discusses a real-world application of simulation to schedule operator and machine resources in a floor tile manufacturing plant. The paper discusses attempts at using a...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
172
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
146
click to vote
ORL
2008
15 years 5 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
187
click to vote
JSSPP
1995
Springer
15 years 10 months ago
1995
Springer
During the past ve years scientists discovered that modern UNIX workstations connected with ethernet and ber networks could provide enough computational performance to compete wit...