Sciweavers

1243 search results - page 65 / 249
» EDZL Scheduling Analysis
Sort
View
89
Voted
COR
2006
138views more  COR 2006»
15 years 22 days ago
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
RTAS
2010
IEEE
14 years 11 months ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
TON
2010
136views more  TON 2010»
14 years 7 months ago
Distributed Opportunistic Scheduling With Two-Level Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
112
Voted
CN
2002
117views more  CN 2002»
15 years 16 days ago
Achieving differentiated services through multi-class probabilistic priority scheduling
Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an...
Chen-Khong Tham, Qi Yao, Yuming Jiang
93
Voted
MST
2000
57views more  MST 2000»
15 years 14 days ago
On Scheduling Parallel Tasks at Twilight
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...
Hannah Bast