Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

SpringerBriefs in Mathematics

Machine Scheduling to Minimize Weighted Completion Times

The Use of the α-point

Authors: Gusmeroli, Nicoló

Free Preview
  • 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
see more benefits

Buy this book

eBook 41,64 €
price for Spain (gross)
  • ISBN 978-3-319-77528-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-319-77527-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
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.

About the authors

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.

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)

Table of contents (1 chapters)

Table of contents (1 chapters)

Buy this book

eBook 41,64 €
price for Spain (gross)
  • ISBN 978-3-319-77528-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover 51,99 €
price for Spain (gross)
  • ISBN 978-3-319-77527-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Machine Scheduling to Minimize Weighted Completion Times
Book Subtitle
The Use of the α-point
Authors
Series Title
SpringerBriefs in Mathematics
Copyright
2018
Publisher
Springer International Publishing
Copyright Holder
The Author(s)
eBook ISBN
978-3-319-77528-9
DOI
10.1007/978-3-319-77528-9
Softcover ISBN
978-3-319-77527-2
Series ISSN
2191-8198
Edition Number
1
Number of Pages
XI, 53
Number of Illustrations
2 illustrations in colour
Topics