Pages that link to "Item:Q834944"
From MaRDI portal
The following pages link to Optimal preemptive semi-online scheduling on two uniform processors (Q834944):
Displaying 15 items.
- Semi-online scheduling with bounded job sizes on two uniform machines (Q338376) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines (Q1889769) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Semi-online scheduling on two uniform processors (Q2481966) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- Geometric representation for semi on-line scheduling on uniform processors (Q3562411) (← links)
- Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality (Q4606335) (← links)
- Algorithms and Computation (Q5897875) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
