Machine scheduling to minimize weighted completion times : the use of the [alpha]-point / Nicoló Gusmeroli.
2018
T57.6 .G87 2018
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Machine scheduling to minimize weighted completion times : the use of the [alpha]-point / Nicoló Gusmeroli.
Author
Gusmeroli, Nicoló, author.
ISBN
9783319775289 (electronic book)
3319775286 (electronic book)
9783319775272
3319775286 (electronic book)
9783319775272
Published
Cham, Switzerland : Springer, [2018]
Language
English
Description
1 online resource (xi, 53 pages) : color illustrations.
Item Number
10.1007/978-3-319-77528-9 doi
Call Number
T57.6 .G87 2018
Dewey Decimal Classification
658.4/034
Summary
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.
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Digital File Characteristics
text file PDF
Source of Description
Description based on online resource; title from digital title page (viewed on May 15, 2018).
Series
SpringerBriefs in mathematics.
Available in Other Form
Print version: 9783319775272
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of Contents
1 Introduction
2 List of Main Results
3 LP Relaxations for the Release Dates Case
4 Conversion Algorithm
5 Approximations for 1
2 List of Main Results
3 LP Relaxations for the Release Dates Case
4 Conversion Algorithm
5 Approximations for 1