Overview
- 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
Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (1 chapter)
-
Front Matter
-
Back Matter
Reviews
“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)
Authors and Affiliations
About the author
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.
Bibliographic Information
Book Title: Machine Scheduling to Minimize Weighted Completion Times
Book Subtitle: The Use of the α-point
Authors: Nicoló Gusmeroli
Series Title: SpringerBriefs in Mathematics
DOI: https://doi.org/10.1007/978-3-319-77528-9
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Author(s) 2018
Softcover ISBN: 978-3-319-77527-2Published: 14 May 2018
eBook ISBN: 978-3-319-77528-9Published: 30 April 2018
Series ISSN: 2191-8198
Series E-ISSN: 2191-8201
Edition Number: 1
Number of Pages: XI, 53
Number of Illustrations: 2 illustrations in colour
Topics: Operations Research, Management Science, Discrete Optimization, Applications of Mathematics, Algorithms, Polytopes, Discrete Mathematics