Number of the records: 1
Online scheduling of jobs with fixed start times on related machines
- 1.
SYSNO ASEP 0387295 Document Type C - Proceedings Paper (int. conf.) R&D Document Type Conference Paper Title Online scheduling of jobs with fixed start times on related machines Author(s) Epstein, L. (IL)
Jeż, Łukasz (MU-W) RID, SAI, ORCID
Sgall, J. (CZ)
van Stee, R. (DE)Source Title Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. - Berlin : Springer, 2012 / Gupta A. ; Jansen K. ; Rolim J. ; Servedio R. - ISBN 978-3-642-32511-3 Pages s. 134-145 Number of pages 12 s. Publication form Print - P Action 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012 Event date 15.08.2012-17.08.2012 VEvent location Cambridge Country US - United States Event type WRD Language eng - English Country DE - Germany Keywords online scheduling ; algorithm analysis Subject RIV BA - General Mathematics R&D Projects IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR) Institutional support MU-W - RVO:67985840 EID SCOPUS 84865293353 DOI 10.1007/978-3-642-32512-0_12 Annotation 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. Workplace Mathematical Institute Contact Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Year of Publishing 2013
Number of the records: 1