Pages that link to "Item:Q1087469"
From MaRDI portal
The following pages link to The rate of convergence to optimality of the LPT rule (Q1087469):
Displaying 10 items.
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An introduction to the analysis of approximation algorithms (Q1076513) (← 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)
- A note on posterior tight worst-case bounds for longest processing time schedules (Q2423296) (← links)
- Ordinal Maximin Share Approximation for Goods (Q5094017) (← links)
- (Q5708542) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
