Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics (PDF)

Name: Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics
Brand: Springer-Verlag GmbH
SKU: 100725233
Price: 53.49 EUR
Availability: OnlineOnly

The Use of the a-point (Sprache: Englisch)

Autor: Nicoló Gusmeroli

Schreiben Sie einen Kommentar zu "Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics".

Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics, Nicoló Gusmeroli

Merken

Mehr zum Inhalt Presse-Zitate Autorenporträt Video

eBook (pdf) 53.49 €

Buch (Kartoniert) 53.49 €

sofort als Download lieferbar

Bestellnummer: 100725233

eBook (pdf) 53.49 €

Download bestellen

Verschenken

26 DeutschlandCard Punkte sammeln

Lastschrift, Kreditkarte, Paypal, Rechnung
Kostenloser tolino webreader

Produktdetails

Produktbeschreibung
Autorenporträt
eBook Hilfe
Biblio. Angaben / Produktdetails
Pressezitat

Produktinformationen zu „Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics (PDF)“

This work reviews the most important results regarding the use of the a-point in Scheduling Theory. It provides a number of different LP-relaxations for scheduling problems and seeks to explain their polyhedral consequences. It also explains the concept of the a-point and how the conversion algorithm works, pointing out the relations to the sum of the weighted completion times. Lastly, the book explores the latest techniques used for many scheduling problems with different constraints, such as release dates, precedences, and parallel machines. This reference book is intended for advanced undergraduate and postgraduate students who are interested in scheduling theory. It is also inspiring for researchers wanting to learn about sophisticated techniques and open problems of the field.

Autoren-Porträt von Nicoló Gusmeroli

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.

eBook Hilfe

Informationen und Hilfe zu eBooks hier klicken!

Bibliographische Angaben

Autor: Nicoló Gusmeroli
2018, 1st ed. 2018, 53 Seiten, Englisch
Verlag: Springer-Verlag GmbH
ISBN-10: 3319775286
ISBN-13: 9783319775289
Erscheinungsdatum: 30.04.2018

Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.

eBook Informationen

Dateiformat: PDF
Größe: 0.84 MB
Ohne Kopierschutz
Vorlesefunktion

Sprache:

Englisch

Pressezitat

“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)

Kommentar zu "Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics"

Schreiben Sie einen Kommentar zu "Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics".

Wie funktionieren Bewertungen?

0 Gebrauchte Artikel zu „Machine Scheduling to Minimize Weighted Completion Times / SpringerBriefs in Mathematics“

Zustand	Preis	Porto	Zahlung	Verkäufer	Rating