The following pages link to STACS 2004 (Q5309700):
Displaying 14 items.
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Online scheduling on semi-related machines (Q963475) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- On-line preemptive scheduling on uniform machines (Q1348609) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Optimal Allocation for Chunked-Reward Advertising (Q2937765) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311130) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)