Number of the records: 1  

Online scheduling of jobs with fixed start times on related machines

  1. 1.
    0387295 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
    Epstein, L. - Jeż, Łukasz - Sgall, J. - van Stee, R.
    Online scheduling of jobs with fixed start times on related machines.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Berlin: Springer, 2012 - (Gupta, A.; Jansen, K.; Rolim, J.; Servedio, R.), s. 134-145. Lecture Notes in Computer Science, 7408. ISBN 978-3-642-32511-3.
    [15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012. Cambridge (US), 15.08.2012-17.08.2012]
    R&D Projects: GA AV ČR IAA100190902
    Institutional support: RVO:67985840
    Keywords : online scheduling * algorithm analysis
    Subject RIV: BA - General Mathematics

    We consider online preemptive scheduling of jobs with fixed starting times revealed at those times on m uniformly related machines, with the goal of maximizing the total weight of completed jobs. Every job has a size and a weight associated with it. A newly released job must be either assigned to start running immediately on a machine or otherwise it is dropped. It is also possible to drop an already scheduled job, but only completed jobs contribute their weights to the profit of the algorithm.
    Permanent Link:

    Jez.pdf1236.4 KBPublisher’s postprintrequire
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.