Pages that link to "Item:Q1866010"
From MaRDI portal
The following pages link to Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010):
Displaying 22 items.
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
- Semi-online scheduling on two uniform machines with the known largest size (Q491206) (← 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)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation (Q927393) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data (Q1767979) (← links)
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines (Q1889769) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information (Q2464037) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
- Preemptive machine covering on parallel machines (Q2583174) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online minimum makespan scheduling with a buffer (Q2929632) (← links)
- Disjoint Path Allocation with Sublinear Advice (Q3196403) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- SEMI-ONLINE MACHINE COVERING (Q5295439) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)