Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Machine Scheduling to Minimize Weighted Completion Times

The Use of the -point
Book on DemandKartoniert, Paperback
53 Seiten
Englisch
Springererschienen am14.05.20181st ed. 2018
This work reviews the most important results regarding the use of the α-point in Scheduling Theory. Lastly, the book explores the latest techniques used for many scheduling problems with different constraints, such as release dates, precedences, and parallel machines.mehr
Verfügbare Formate
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49
Book on DemandKartoniert, Paperback
EUR53,49

Produkt

KlappentextThis work reviews the most important results regarding the use of the α-point in Scheduling Theory. Lastly, the book explores the latest techniques used for many scheduling problems with different constraints, such as release dates, precedences, and parallel machines.
Zusammenfassung
Presents self-contained content

Includes a diverse range of problems and explains the similarities/differences

Collects all of the most important results in the field
Details
ISBN/GTIN978-3-319-77527-2
ProduktartBook on Demand
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2018
Erscheinungsdatum14.05.2018
Auflage1st ed. 2018
ReiheSpringerBriefs in Mathematics
Seiten53 Seiten
SpracheEnglisch
Gewicht130 g
IllustrationenXI, 53 p. 2 illus. in color.
Artikel-Nr.44481181

Inhalt/Kritik

Inhaltsverzeichnis
1 Introduction.- 2 List of Main Results.- 3 LP Relaxations for the Release Dates Case.- 4 Conversion Algorithm.- 5 Approximations for 1| rj | â wjCj.- 6  Approximations for  1| rj | â Cj.- 7 Approximation for 1| rj, prec | â wj Cj.- 8 Approximation for P | r j | â Cj.- 9 Approximation for P | dij | â wj Cj.- 10 Conclusions.mehr
Kritik
"This work provides a detailed survey of the papers published during the past two decades. It is devoted to developing and evaluating the performance of constant-factor approximation algorithms for scheduling problems. ... The author provides examples which illustrate the used concepts and prove the tightness of the obtained theoretical bounds. In conclusion, the author indicates a number of open questions and conjectures." (Svetlana A. Kravchenko, zbMATH 1395.90003, 2018)mehr

Schlagworte

Autor

Nicoló Gusmeroli completed his Master's degree at the ELTE University of Budapest in 2017, and is currently working on the project High-Performance Solver for Binary Quadratic Problems at the Alpen-Adria University of Klagenfurt as a PhD student. His main research interests are in combinatorial optimization, semidefinite optimization, and scheduling theory. He completed his Bachelor's studies at the University of Verona prior to spending an exchange semester at the University of Primorska (Slovenia), where he wrote his Bachelor's thesis.
Weitere Artikel von
Gusmeroli, Nicoló