Sciweavers

IPL
2006
89views more  IPL 2006»
13 years 11 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
AOR
2007
107views more  AOR 2007»
13 years 11 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...