Pages that link to "Item:Q5891554"

The following pages link to The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders (Q5891554):

Displaying 17 items.

• Parallel machine covering with limited number of preemptions (Q462268) (← links)
• Robust algorithms for preemptive scheduling (Q472464) (← links)
• On the configuration-LP for scheduling on unrelated machines (Q490331) (← links)
• Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
• Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
• Scheduling maintenance jobs in networks (Q1628599) (← links)
• Splitting versus setup trade-offs for scheduling to minimize weighted completion time (Q1694777) (← links)
• The benefit of preemption for single machine scheduling so as to minimize total weighted completion time (Q1709959) (← links)
• Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
• Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
• Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
• Task assignment algorithms for two-type heterogeneous multiprocessors (Q2251393) (← links)
• Real-time scheduling with resource sharing on heterogeneous multiprocessors (Q2251407) (← links)
• A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
• Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
• The benefit of preemption with respect to the \(\ell_p\) norm (Q2417189) (← links)
• Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines (Q2957687) (← links)