Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Online Scheduling of Jobs with Fixed Start Times on Related Machines

Epstein, L., Jez, L., Sgall, J., & van Stee, R. (2012). Online Scheduling of Jobs with Fixed Start Times on Related Machines. In A. Gupta, K. Jansen, J. Rolim, & R. Servedio (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 134-145). Berlin: Springer. doi:10.1007/978-3-642-32512-0_12.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Epstein, Leah1, Autor
Jez, Lukasz1, Autor
Sgall, Jiri1, Autor
van Stee, Rob2, Autor           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We consider online preemptive throughput scheduling of jobs with fixed starting times on m uniformly related machines, with the goal of maximizing the profit of the completed jobs. In this problem, jobs are released over time. 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. In the most general setting, no algorithm has bounded competitive ratio, and we consider a number of standard variants. We give a full classification of the variants into cases which admit constant competitive ratio (weighted and unweighted unit jobs, and C-benevolent instances, which is a wide class of instances containing proportional-weight jobs), and cases which admit only a linear competitive ratio (unweighted jobs and D-benevolent instances). In particular, we give a lower bound of m on the competitive ratio for scheduling unit weight jobs with varying sizes, which is tight. For unit size and weight we show that a natural greedy algorithm is 4/3-competitive and optimal on m=2 machines, while for a large m, its competitive ratio is between 1.56 and 2. Furthermore, no algorithm is better than 1.5-competitive.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2012-082012
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: DOI: 10.1007/978-3-642-32512-0_12
BibTex Citekey: EpJeSS12
Anderer: Local-ID: CA0E53116309F933C1257AB6003C51EB-EpJeSS12
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 16th International Workshop on Randomization and Computation
Veranstaltungsort: Cambridge, MA
Start-/Enddatum: 2012-08-15 - 2012-08-17

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  Untertitel : 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012
  Kurztitel : APPROX/RANDOM 2012
Genre der Quelle: Konferenzband
 Urheber:
Gupta, Anupam1, Herausgeber
Jansen, Klaus1, Herausgeber
Rolim, José1, Herausgeber
Servedio, Rocco1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: Berlin : Springer
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 134 - 145 Identifikator: ISBN: 978-3-642-32511-3

Quelle 2

einblenden:
ausblenden:
Titel: Lecture Notes in Computer Science
  Kurztitel : LNCS
Genre der Quelle: Reihe
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 7408 Artikelnummer: - Start- / Endseite: - Identifikator: ISSN: 0302-9743