Pages that link to "Item:Q604878"

The following pages link to A note on hierarchical scheduling on two uniform machines (Q604878):

Displaying 19 items.

• Semi-online scheduling problems on two uniform machines under a grade of service provision (Q388114) (← 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)
• On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← 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)
• Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
• Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← links)
• On-line booking policies and competitive analysis of medical examination in hospital (Q2336398) (← 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)
• Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← 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)
• Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs (Q5248073) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
• Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
• Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time (Q6084675) (← links)