Machine Scheduling to Minimize Weighted Completion Times
The Use of the α-point
Buch in deiner Nähe kaufen
Beschreibung
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.
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.
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
Autor*in
Nicoló Gusmeroli
Themen in »Machine Scheduling to Minimize Weighted Completion Times«
Scheduling theory Approximation algorithms LP-relaxation α-point Release dates
Stimmen zu »Machine Scheduling to Minimize Weighted Completion Times«
“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)
()