Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAcknowledgements
I would like to thank my supervisor, Professor Kis Tamás, for all the time that he spent with me. He was my guide in this work and I am really grateful to him that he introduce me to Scheduling Theory. But, first of all, I would like to thank my Mum and my Dad, my two brothers and all those people that I consider my family, because they made me the person who I am.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 The Author(s)
About this chapter
Cite this chapter
Gusmeroli, N. (2018). Machine Scheduling to Minimize Weighted Completion Times. In: Machine Scheduling to Minimize Weighted Completion Times. SpringerBriefs in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-77528-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-77528-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77527-2
Online ISBN: 978-3-319-77528-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)