Pages that link to "Item:Q3686419"

The following pages link to On the Expected Relative Performance of List Scheduling (Q3686419):

Displaying 19 items.

• Decentralized list scheduling (Q367649) (← links)
• The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
• Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
• Distribution-free bounds on the expectation of the maximum with scheduling applications (Q751993) (← links)
• Scheduling independent jobs with stochastic processing times and a common due date on parallel and identical machines (Q917426) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• The ratio of the extreme to the sum in a random sequence (Q1003314) (← links)
• Analysis of the list scheduling algorithm for precedence constrained parallel tasks (Q1304383) (← links)
• A new on-line scheduling heuristic (Q1319539) (← links)
• List scheduling revisited (Q1919183) (← links)
• The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays (Q2400440) (← links)
• An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks (Q2497732) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Scheduling independent tasks to minimize the makespan on identical machines (Q2805367) (← links)
• A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors (Q3325433) (← links)
• (Q3576157) (← links)
• A probabilistic analysis of multiprocessor list scheduling: the erlang case (Q3742709) (← links)
• Stochastic convexity of sums of i.i.d. non-negative random variables with applications (Q3992294) (← links)
• Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops (Q4487091) (← links)