Pages that link to "Item:Q3186530"

The following pages link to Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530):

Displaying 14 items.

• Scheduling in multi-scenario environment with an agreeable condition on job processing times (Q2070719) (← links)
• Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• On index policies for stochastic minsum scheduling (Q2294301) (← links)
• Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
• An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
• (Q3304142) (← links)
• Performance of the Smallest-Variance-First Rule in Appointment Sequencing (Q5031672) (← links)
• Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
• Approximations to Stochastic Dynamic Programs via Information Relaxation Duality (Q5126622) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)