Machine scheduling to minimize weighted completion times :
General Material Designation
[Book]
Other Title Information
the use of the [alpha]-point /
First Statement of Responsibility
Nicoló Gusmeroli.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cham, Switzerland :
Name of Publisher, Distributor, etc.
Springer,
Date of Publication, Distribution, etc.
[2018]
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
1 online resource (xi, 53 pages) :
Other Physical Details
color illustrations
SERIES
Series Title
SpringerBriefs in mathematics
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references.
CONTENTS NOTE
Text of Note
1 Introduction -- 2 List of Main Results -- 3 LP Relaxations for the Release Dates Case -- 4 Conversion Algorithm -- 5 Approximations for 1.
0
SUMMARY OR ABSTRACT
Text of Note
This work reviews the most important results regarding the use of the [alpha]-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 [alpha]-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.