Pages that link to "Item:Q837151"
From MaRDI portal
The following pages link to Online parallel machines scheduling with two hierarchies (Q837151):
Displayed 19 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- Online hierarchical scheduling: an approach using mathematical programming (Q621843) (← links)
- Online and semi-online hierarchical scheduling for load balancing on uniform machines (Q631770) (← links)
- Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- OPTIMAL ONLINE ALGORITHMS ON TWO HIERARCHICAL MACHINES WITH RESOURCE AUGMENTATION (Q2905313) (← links)
- Online Hierarchical Scheduling on Two Uniform Machines with Bounded Job Sizes (Q3455876) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)