Lift-and-round to improve weighted completion time on unrelated machines-Reference-Cited by-同舟云学术

Lift-and-round to improve weighted completion time on unrelated machines

Published:2016-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
language:
Short-container-title:

Author:

Bansal Nikhil¹,Srinivasan Aravind²,Svensson Ola³

Affiliation:

1. Eindhoven University of Technology, Netherlands

2. University of Maryland, USA

3. EPFL, Switzerland

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2897518.2897572

Reference36 articles.

1. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

2. Santa claus meets hypergraph matchings

3. 4 This bound is loose and can also be obtained using independent randomized rounding instead of our negative-correlation rounding. The importance of the new rounding appears in the other case. 4 This bound is loose and can also be obtained using independent randomized rounding instead of our negative-correlation rounding. The importance of the new rounding appears in the other case.

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs;European Journal of Operational Research;2024-08

2. Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines;Journal of Combinatorial Optimization;2024-03-31

3. Developing New Bounds for the Performance Guarantee of the Jump Neighborhood for Scheduling Jobs on Uniformly Related Machines;Mathematics;2023-12-19

4. Memetic algorithm for unrelated parallel machine scheduling problem with grey processing times;Journal of Modelling in Management;2022-06-15

5. Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines;RAIRO - Operations Research;2022-03