Machine Scheduling to Minimize Weighted Completion Times
Springer International Publishing (Verlag)
978-3-319-77527-2 (ISBN)
This work reviews the most important results regarding the use of the -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 -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.
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.
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.
"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)
“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)
| Erscheinungsdatum | 27.05.2018 |
|---|---|
| Reihe/Serie | SpringerBriefs in Mathematics |
| Zusatzinfo | XI, 53 p. 2 illus. in color. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 118 g |
| Themenwelt | Mathematik / Informatik ► Mathematik |
| Wirtschaft ► Betriebswirtschaft / Management | |
| Schlagworte | approximation algorithms • LP-relaxation • -point • Release dates • Scheduling Theory • α-point |
| ISBN-10 | 3-319-77527-8 / 3319775278 |
| ISBN-13 | 978-3-319-77527-2 / 9783319775272 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
