Machine scheduling to minimize weighted completion times : the use of the [alpha]-point / Nicoló Gusmeroli.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Machine scheduling to minimize weighted completion times : the use of the [alpha]-point / Nicoló Gusmeroli.

9783319775289 (electronic book)
3319775286 (electronic book)
9783319775272

Cham, Switzerland : Springer, [2018]

English

1 online resource (xi, 53 pages) : color illustrations.

10.1007/978-3-319-77528-9 doi

T57.6 .G87 2018

658.4/034

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.

Includes bibliographical references.

Access limited to authorized users.

text file PDF

Description based on online resource; title from digital title page (viewed on May 15, 2018).

SpringerBriefs in mathematics.

Print version: 9783319775272

Online Resources > Ebooks
All Resources