Advertisement

Machine Scheduling to Minimize Weighted Completion Times

The Use of the α-point

  • Nicoló Gusmeroli

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Back Matter
    Pages 51-53

About this book

Introduction

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.

Keywords

Scheduling theory Approximation algorithms LP-relaxation α-point Release dates

Authors and affiliations

  • Nicoló Gusmeroli
    • 1
  1. 1.Institut für MathematikAlpen-Adria-UniversitätKlagenfurtAustria

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-77528-9
  • Copyright Information The Author(s) 2018
  • Publisher Name Springer, Cham
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-319-77527-2
  • Online ISBN 978-3-319-77528-9
  • Series Print ISSN 2191-8198
  • Series Online ISSN 2191-8201
  • Buy this book on publisher's site