Pages that link to "Item:Q1919176"
From MaRDI portal
The following pages link to An optimal algorithm for preemptive on-line scheduling (Q1919176):
Displaying 44 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm (Q813965) (← links)
- Preemptive scheduling on a small number of hierarchical machines (Q924724) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← 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)
- Randomized on-line scheduling on three processors. (Q1417594) (← links)
- Resource augmentation in load balancing. (Q1588053) (← links)
- On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
- Preemptive online algorithms for scheduling with machine cost (Q1777224) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- An optimal online algorithm for scheduling with general machine cost functions (Q2173052) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors (Q2386614) (← links)
- On the value of job migration in online makespan minimization (Q2408930) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors (Q2508042) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- An on-line LS algorithm for some \(Q_m|r_j|C_{\max}\) scheduling (Q2780944) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- Online scheduling of two type parallel jobs on identical machines (Q3170006) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines (Q4565266) (← links)
- Preemptive weighted completion time scheduling of parallel jobs (Q4595476) (← links)
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality (Q4606335) (← links)
- (Q5009506) (← links)
- Semi-online scheduling with decreasing job sizes (Q5929138) (← links)
- On-line scheduling of small open shops (Q5936457) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- Preemptive multiprocessor scheduling with rejection (Q5958131) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts (Q6112585) (← links)