Pages that link to "Item:Q3770267"

The following pages link to The Asymptotic Optimality of the LPT Rule (Q3770267):

Displaying 27 items.

• Performance of the LPT algorithm in multiprocessor scheduling (Q583889) (← links)
• Parallel machines scheduling with nonsimultaneous machine available time (Q757232) (← links)
• New directions in scheduling theory (Q786649) (← links)
• An analysis of the LPT algorithm for the max-min and the min-ratio partition problems (Q817816) (← links)
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
• Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
• Concurrent stochastic methods for global optimization (Q908855) (← links)
• On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints (Q909452) (← links)
• A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
• Approximation results in parallel machines stochastic scheduling (Q922283) (← links)
• An introduction to the analysis of approximation algorithms (Q1076513) (← links)
• The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
• An algorithm for flow time minimization and its asymptotic makespan properties (Q1198009) (← links)
• A general lower bound for the makespan problem (Q1266724) (← links)
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
• Sensitivity analysis of list scheduling heuristics (Q1339396) (← links)
• List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
• Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
• Scheduling job classes on uniform machines (Q1761112) (← links)
• Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
• The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
• A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
• On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem (Q4530655) (← links)
• Scheduling and due‐date quotation in a make‐to‐order supply chain (Q5393028) (← links)
• A common due-data assignment problem on parallel identical machines (Q5953163) (← links)
• The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
• Update on the Asymptotic Optimality of LPT (Q6487184) (← links)