Pages that link to "Item:Q1348609"
From MaRDI portal
The following pages link to On-line preemptive scheduling on uniform machines (Q1348609):
Displaying 21 items.
- On-line scheduling of equal-length intervals on parallel machines (Q436333) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time (Q837179) (← links)
- Online scheduling of two uniform machines to minimize total completion times (Q1013450) (← links)
- Online scheduling to minimize modified total tardiness with an availability constraint (Q1034623) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Scheduling uniform machines on-line requires nondecreasing speed ratios (Q1290644) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- An optimal algorithm for preemptive on-line scheduling (Q1919176) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- A parametric scheme for online uniform-machine scheduling to minimize the makespan (Q2833437) (← links)
- The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times (Q2910573) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- STACS 2004 (Q5309700) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts (Q6112585) (← links)
