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

@inproceedings{Khuller2017SelectAP,
  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={2017}
}
  • Samir Khuller, Jingling Li, +2 authors Prayaag Venkat
  • Published in LATIN 2017
  • Computer Science, Mathematics
  • 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

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    Order Scheduling Models: Hardness and Algorithms

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    Improved Scheduling Algorithms for Minsum Criteria

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Efficient coflow scheduling with Varys

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Coflow: a networking abstraction for cluster applications

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL