Pages that link to "Item:Q621843"

The following pages link to Online hierarchical scheduling: an approach using mathematical programming (Q621843):

Displaying 16 items.

• Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
• Total completion time minimization scheduling on two hierarchical uniform machines (Q1676324) (← links)
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← 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)
• An optimal online algorithm for fractional scheduling on uniform machines with three hierarchies (Q2014427) (← links)
• Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
• Online scheduling with unit processing times and processing set restrictions (Q2326081) (← links)
• Online fractional hierarchical scheduling on uniformly related machines (Q2333135) (← 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)
• Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← 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)
• Bin stretching with migration on two hierarchical machines (Q6093406) (← links)