Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time

@inproceedings{Khuller2018SelectAP,
  title={Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time},
  author={Samir Khuller and Jingling Li and Pascal Sturmfels and Kevin Sun and Prayaag Venkat},
  booktitle={LATIN},
  year={2018}
}
In this paper, we introduce a new online scheduling framework for minimizing total weighted completion time in a general setting. The framework is inspired by the work of Hall et al. [10] and Garg et al. [8], who show how to convert an offline approximation to an online scheme. Our framework uses two offline approximation algorithms—one for the simpler problem of scheduling without release times, and another for the minimum unscheduled weight problem—to create an online algorithm with provably… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Select and permute: An improved online framework for scheduling to minimize weighted completion time

S. Khuller, J. Li, P. Sturmfels, K. Sun, P. Venkat
arXiv preprint arXiv:1704.06677 • 2017
View 4 Excerpts
Highly Influenced

Efficient coflow scheduling with Varys

View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…