Pages that link to "Item:Q922283"

The following pages link to Approximation results in parallel machines stochastic scheduling (Q922283):

Displaying 10 items.

• An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
• Analysis of computer job control under uncertainty (Q2263387) (← links)
• Stochastic scheduling on parallel machines to minimize discounted holding costs (Q2268513) (← links)
• Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
• (Q3304142) (← links)
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on <i>M</i> + 1 Parallel Machines (Q3416042) (← links)
• Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
• On Suboptimal Policies in Multiclass Tandem Models (Q5485353) (← links)
• Stochastic Online Scheduling Revisited (Q5505682) (← links)