80 search results - page 8 / 16 » A tight lower bound for job scheduling with cancellation |
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when ...
IJAHUC
2007
13 years 7 months ago
2007
: In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us ...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
— Input-queued switches are used extensively in the design of high-speed routers. As switch speeds and sizes increase, the design of the switch scheduler becomes a primary challe...
AIPS
2009
13 years 8 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...