Greed works-online algorithms for unrelated machine stochastic scheduling

Autor: Benjamin Moseley, Qiaomin Xie, Varun Gupta, Marc Uetz

Publikováno v: Mathematics of operations research, 45(2), 497-516. INFORMS Institute for Operations Research and the Management Sciences

This paper establishes performance guarantees for online algorithms that schedule stochastic, nonpreemptive jobs on unrelated machines to minimize the expected total weighted completion time. Prior work on unrelated machine scheduling with stochastic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef40b7e4ad6add8511d699ae503c87a5
https://research.utwente.nl/en/publications/36f11f56-0538-4b16-b70c-32519e4a4bf0

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Stochastic and Robust Scheduling in the Cloud

Autor: Chen, Lin, Megow, N., Rischke, R., Stougie, L., Garg, N.

Publikováno v: Chen, L, Megow, N, Rischke, R & Stougie, L 2015, Stochastic and Robust Scheduling in the Cloud . in N Garg & et al. (eds), Leibniz International Proceedings in Informatics Volume 40 . Schloss Dagstuhl, Leibniz, pp. 175-186, APPROX 2015, 24/08/15 . https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.175
Leibniz International Proceedings in Informatics Volume 40, 175-186
STARTPAGE=175;ENDPAGE=186;TITLE=Leibniz International Proceedings in Informatics Volume 40
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), Aug 2015, Princeton, United States. pp.175-186, ⟨10.4230/LIPIcs.APPROX-RANDOM.2015.175⟩

International audience; Users of cloud computing services are offered rapid access to computing resources via the Internet. Cloud providers use different pricing options such as (i) time slot reservation in advance at a fixed price and (ii) on-demand

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8ea8ff01ee1cd2e253e590e640a553f
https://research.vu.nl/en/publications/3e9ee81a-fd8f-4578-a184-9d6db6d6ca85

Computational experiments with a cutting-plane algorithm for a time-indexed formulation

Autor: Berghman, Lotte, Spieksma, Frits

We consider a time-indexed formulation for the unrelated parallel machine scheduling problem. We show that all polyhedral knowledge known from the single machine problem (in particular, valid inequalities) is applicable to this formulation. We also p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1131::ef08547a667c7d07e85788f0fcb6cb58
https://lirias.kuleuven.be/handle/123456789/354100

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.