JCO
2002
13 years 4 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
MST
2000
13 years 4 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
COR
2007
13 years 4 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
FCCM
2004
IEEE
13 years 8 months ago
2004
IEEE
This paper presents ADB, an Alternate Wire Database, suitable for routing, tracing, and browsing in Xilinx Virtex, Virtex-E, Virtex-II, and Virtex-II Pro FPGAs. While mainstream d...
ICTCS
2005
Springer
13 years 9 months ago
2005
Springer
We study the effect of laxity, or slack time, on the online scheduling of broadcasts with deadlines. The laxity of a request is defined to be the ratio between its span (differe...
SAGT
2009
Springer
13 years 11 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...